25 search results - page 1 / 5 » The Typed Polymorphic Label-Selective lambda-Calculus |
POPL
1994
ACM
13 years 9 months ago
1994
ACM
LICS
2012
IEEE
11 years 7 months ago
2012
IEEE
—We propose a mathematical framework for step indexed realizability semantics of a call-by-value polymorphic lambda calculus with recursion, existential types and recursive types...
PEPM
1997
ACM
13 years 9 months ago
1997
ACM
Recently, Olivier Danvy introduced a new, simple method for implementing powerful partial evaluators, namely typedirected partial evaluation 9 . He introduced a partial evaluator ...
APAL
2008
13 years 4 months ago
2008
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
ESOP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...