Type reconstruction in finite rank fragments of the second-order λ-calculus
Open Access
- 1 June 1992
- journal article
- Published by Elsevier in Information and Computation
- Vol. 98 (2) , 228-257
- https://doi.org/10.1016/0890-5401(92)90020-g
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Deciding ML typability is complete for deterministic exponential timePublished by Association for Computing Machinery (ACM) ,1990
- Polymorphic type inference and containmentInformation and Computation, 1988
- A simple applicative language: mini-MLPublished by Association for Computing Machinery (ACM) ,1986
- The Expressiveness of Simple and Second-Order Type StructuresJournal of the ACM, 1983
- Functional Characters of Solvable TermsMathematical Logic Quarterly, 1981
- A new type assignment for λ-termsArchive for Mathematical Logic, 1978