Semantic Models For Second-Order Lambda Calculus
- 1 January 1984
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Polymorphism is not set-theoreticLecture Notes in Computer Science, 1984
- From denotational to operational and axiomatic semantics for ALGOL-like languages: An overviewLecture Notes in Computer Science, 1984
- The Expressiveness of Simple and Second-Order Type StructuresJournal of the ACM, 1983
- Structural semantics for polymorphic data types (preliminary report)Published by Association for Computing Machinery (ACM) ,1983
- The complexity of parameter passing in polymorphic proceduresPublished by Association for Computing Machinery (ACM) ,1981
- The typed λ-calculus is not elementary recursiveTheoretical Computer Science, 1979
- Equality between functionalsLecture Notes in Mathematics, 1975
- Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des TypesPublished by Elsevier ,1971
- Correspondence between ALGOL 60 and Church's Lambda-notationCommunications of the ACM, 1965
- Completeness in the theory of typesThe Journal of Symbolic Logic, 1950