Extensional models for polymorphism
Open Access
- 31 July 1988
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 59 (1-2) , 85-114
- https://doi.org/10.1016/0304-3975(88)90097-7
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A small complete categoryAnnals of Pure and Applied Logic, 1988
- Categorical semantics for higher order polymorphic lambda calculusThe Journal of Symbolic Logic, 1987
- Automatic synthesis of typed Λ-programs on term algebrasTheoretical Computer Science, 1985
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985
- λ-definable functionals andβη conversionArchive for Mathematical Logic, 1983
- The Expressiveness of Simple and Second-Order Type StructuresJournal of the ACM, 1983
- Completeness, invariance and λ-definabilityThe Journal of Symbolic Logic, 1982
- What is a model of the lambda calculus?Information and Control, 1982
- Completeness of many-sorted equational logicACM SIGPLAN Notices, 1982
- Lambda‐Calculus Models and ExtensionalityMathematical Logic Quarterly, 1980