596 search results - page 36 / 120 » Subtyping Recursive Types |
ICFP
2003
ACM
16 years 1 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
INTETAIN
2005
Springer
15 years 6 months ago
2005
Springer
Here we present a model of a subtype of one-line jokes (not puns) that describes the relationship between the connector (part of the setup) and the disjunctor (often called the pun...
FLOPS
2004
Springer
15 years 6 months ago
2004
Springer
Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advant...
140
click to vote
LICS
2012
IEEE
13 years 3 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...
FCT
2009
Springer
15 years 8 months ago
2009
Springer
The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algo...