|
51
|
Typability and Type Checking in System F Are Equivalent and Undecidable
– J. B. Wells
- 1998
|
|
129
|
Type Inference with Polymorphic Recursion
– Fritz Henglein
- 1991
|
|
70
|
A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus
– A. J. Kfoury, J. B. Wells
- 1993
|
|
|
Theoretical Foundations for Practical ‘Totally Functional Programming’
– Colin Kemp
- 2007
|
|
3
|
Type Inference and Reconstruction for First Order Dependent Types
– Neal Nelson, To Mary Alice, To Sherri
- 1995
|
|
77
|
The Essence of Principal Typings
– J. B. Wells
- 2002
|
|
3
|
Recasting ML^F
– Didier Le Botlan, Didier Rémy
- 2007
|
|
65
|
Explicit Polymorphism and CPS Conversion
– Robert Harper , Mark Lillibridge
- 1992
|
|
26
|
The Complexity of Type Inference for Higher-Order Typed Lambda Calculi
– Fritz Henglein, Harry G. Mairson
- 1991
|
|
|
Type Theory for Programming Languages
– Robert Harper
- 1994
|
|
24
|
Rank 2 Type Systems and Recursive Definitions
– Trevor Jim
- 1995
|
|
9
|
Typability is undecidable for F+eta
– J. B. Wells
- 1995
|
|
3
|
Type-Secure Meta-Programming
– Christopher Bentley Dornan
- 1998
|
|
7
|
Hierarchies of Decidable Extensions of Bounded Quantification
– Sergei Vorobyov
- 1994
|
|
290
|
Theorems for free!
– Philip Wadler
- 1989
|
|
21
|
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
– Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Turbak, J. B. Wells
- 1999
|
|
26
|
On the undecidability of partial polymorphic type reconstruction
– Frank Pfenning
- 1992
|
|
91
|
Putting Type Annotations to Work
– Martin Odersky, Konstantin Läufer
- 1996
|
|
|
AT DIFFERENT RANKS
– Santiago M. Pericas-geertsen, Assaf J. Kfoury, Ph. D, Santiago M. Pericas-geertsen
- 1999
|
