429 search results - page 46 / 86 » Parameter-free polymorphic types |
CORR
2008
Springer
15 years 2 months ago
2008
Springer
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
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...
108
click to vote
ICFP
1999
ACM
15 years 6 months ago
1999
ACM
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...
110
click to vote
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generaliz...
151
click to vote
WOLLIC
2010
Springer
15 years 9 days ago
2010
Springer
Abstract. The λ-calculus with de Bruijn indices, called λdB, assembles each α-class of λ-terms into a unique term, using indices instead of variable names. Intersection types p...