|
26
|
The Complexity of Type Inference for Higher-Order Typed Lambda Calculi
– Fritz Henglein, Harry G. Mairson
- 1991
|
|
21
|
Polymorphic Type Inference and Semi-Unification
– Fritz Henglein
- 1989
|
|
129
|
Type Inference with Polymorphic Recursion
– Fritz Henglein
- 1991
|
|
|
Type Systems for Programming Languages
– Steffen van Bakel
- 2001
|
|
5
|
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction
– Paris Kanellakis, Gerd Hillebrand, Harry Mairson
- 1994
|
|
1
|
Reflections on complexity of ML type reconstruction
– Tomasz Wierzbicki
- 1997
|
|
17
|
The Impact of the Lambda Calculus in Logic and Computer Science
– Henk Barendregt, Jon Barwise, Johan Van Benthem, Andreas Blass, Olivier Danvy, Pierre Lescanne, Hans Mooij, Robert Maron, Rinus Plasmeijer, Y Pollack
- 1997
|
|
4
|
Quantifier Elimination and Parametric Polymorphism in Programming Languages
– Harry G. Mairson
- 1992
|
|
98
|
On The Type Structure of Standard ML
– Robert Harper, John C. Mitchell
- 1993
|
|
151
|
Refinement types for ML
– Tim Freeman
- 1994
|
|
106
|
Algebraic Reconstruction of Types and Effects
– Pierre Jouvelot, David K. Gifford
- 1991
|
|
|
STORAGE OPERATORS and ∀-POSITIVE TYPES in T T R TYPE
– Karim Nour
|
|
|
STORAGE OPERATORS and ∀-POSITIVE TYPES in TTR TYPE SYSTEM
– Karim Nour
- 905
|
|
55
|
Closure Analysis in Constraint Form
– Jens Palsberg
- 1995
|
|
|
Reliable Frameworks for Extensible Compilers
– Jason Hickey Nathan, Nathan Gray, Aleksey Nogin, Cristian T Ăpus
|
|
1
|
Abstract ML Has Principal Typings
– Carlos Camarão, Lucília Figueiredo
|
|
12
|
A Type System for Computer Algebra
– Philip S. Santas
- 1994
|
|
55
|
A Record Calculus Based on Symmetric Concatenation
– Robert Harper, Benjamin Pierce
- 1991
|
|
26
|
On the undecidability of partial polymorphic type reconstruction
– Frank Pfenning
- 1992
|
