The Complexity of Type Inference for Higher-Order Typed Lambda Calculi (1991)

Cached

Download Links

by Fritz Henglein , Harry G. Mairson
Venue:J. Funct. Programming
Citations:28 - 11 self

Active Bibliography

5 An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction – Paris Kanellakis, Gerd Hillebrand, Harry Mairson - 1994
Lambda-Calculus and Functional Programming – Jonathan P. Seldin
38 Polymorphism and Type Inference in Database Programming – Peter Buneman, Atsushi Ohori
135 Type Inference with Polymorphic Recursion – Fritz Henglein - 1991
102 On The Type Structure of Standard ML – Robert Harper, John C. Mitchell - 1993
326 Theorems for free! – Philip Wadler - 1989
134 Linear Types Can Change the World! – Philip Wadler - 1990
2 Semantic Predicate Types and Approximation for Class-based Object Oriented Programming – Steffen Van Bakel, Reuben N. S. Rowe
18 Higher Order Logic – Daniel Leivant - 1994
66 Programming with Intersection Types and Bounded Polymorphism – Benjamin C. Pierce - 1991
Theoretical Foundations for Practical ‘Totally Functional Programming’ – Colin Kemp - 2007
8 A Study of Semantics, Types, and Languages for Databases and Object Oriented Programming – Atsushi Ohori - 1989
78 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
58 Typability and Type Checking in System F Are Equivalent and Undecidable – J. B. Wells - 1998
12 Typability and Type Checking in the Second-Order lambda-Calculus Are Equivalent and Undecidable – J. B. Wells - 1993
68 Explicit Polymorphism and CPS Conversion – Robert Harper , Mark Lillibridge - 1992
Domain-Specific Embedded Languages – Kevin Backhouse - 2002
A Short Introduction to Systems F and Fω – Pablo Nogueira - 2006
2 Type Theory with First-Order Data Types and Size-Change Termination – David Wahlstedt - 2004