Sciweavers

4211 search results - page 3 / 843
» Types as Abstract Interpretations
Sort
View
FLOPS
1999
Springer
13 years 11 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer
APLAS
2007
ACM
13 years 11 months ago
Finally Tagless, Partially Evaluated
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
Jacques Carette, Oleg Kiselyov, Chung-chieh Shan
ENTCS
2008
80views more  ENTCS 2008»
13 years 7 months ago
Idempotents in Dagger Categories: (Extended Abstract)
d abstract) Peter Selinger1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories were studied by Abramsky a...
Peter Selinger
ICCL
1992
IEEE
13 years 11 months ago
Static analysis of PostScript code
rogram. Our abstract interpretation algorithm may then be used to perform static type analysis. The analysis has applications in detecting probable errors in the PostScript code or...
R. Nigel Horspool, Jan Vitek
FOSSACS
2009
Springer
14 years 2 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...