Type inference with recursive types: Syntax and semantics
- 1 May 1991
- journal article
- Published by Elsevier in Information and Computation
- Vol. 92 (1) , 48-80
- https://doi.org/10.1016/0890-5401(91)90020-3
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- An ideal model for recursive polymorphic typesInformation and Control, 1986
- The solutions of two star-height problems for regular treesTheoretical Computer Science, 1984
- Completeness of type assignment in continuous lambda modelsTheoretical Computer Science, 1984
- The completeness theorem for typing λ-termsTheoretical Computer Science, 1983
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- Set-theoretical models of λ-calculus: theories, expansions, isomorphismsAnnals of Pure and Applied Logic, 1983
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- Algebras and combinatorsAlgebra universalis, 1981
- Modified basic functionality in combinatory logicDialectica, 1969