117 search results - page 2 / 24 » Extracting Programs with Exceptions in an Impredicative Type... |
POPL
2007
ACM
14 years 6 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
POPL
1999
ACM
13 years 10 months ago
1999
ACM
This paper presents a program analysis to estimate uncaught exceptions in ML programs. This analysis relies on unification-based type inference in a non-standard type system, usi...
APLAS
2007
ACM
13 years 10 months ago
2007
ACM
Abstract. This paper presents a polymorphic type system for a language with delimited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski...
ICFP
2007
ACM
14 years 6 months ago
2007
ACM
The MLF type system by Le Botlan and R?emy (2003) is a natural extension of Hindley-Milner type inference that supports full firstclass polymorphism, where types can be of higher-...
TLCA
2007
Springer
14 years 11 days ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...