Polymorphic type inference and containment
- 1 February 1988
- journal article
- Published by Elsevier in Information and Computation
- Vol. 76 (2-3) , 211-249
- https://doi.org/10.1016/0890-5401(88)90009-0
Abstract
No abstract availableKeywords
This publication has 14 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 completeness theorem for typing λ-termsTheoretical Computer Science, 1983
- Curry's type-rules are complete with respect to the F-semantics tooTheoretical Computer Science, 1983
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- The Expressiveness of Simple and Second-Order Type StructuresJournal of the ACM, 1983
- What is a model of the lambda calculus?Information and Control, 1982
- On the Semantics of “Data Type”SIAM Journal on Computing, 1979
- A Syntactic Characterization of the Equality in Some Models for the Lambda CalculusJournal of the London Mathematical Society, 1976
- Completeness in the theory of typesThe Journal of Symbolic Logic, 1950