The semantics of second-order lambda calculus
- 1 March 1990
- journal article
- Published by Elsevier in Information and Computation
- Vol. 85 (1), 76-134
- https://doi.org/10.1016/0890-5401(90)90044-i
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Domain theoretic models of polymorphismInformation and Computation, 1989
- The system F of variable types, fifteen years laterTheoretical Computer Science, 1986
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985
- The completeness theorem for typing λ-termsTheoretical 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
- Recursive models for constructive set theoriesAnnals of Mathematical Logic, 1982
- Models of the lambda calculusInformation and Control, 1982
- On the Semantics of “Data Type”SIAM Journal on Computing, 1979
- Completeness in the theory of typesThe Journal of Symbolic Logic, 1950