Can LCF be topped? Flat lattice models of typed λ-calculus
Open Access
- 1 July 1990
- journal article
- Published by Elsevier in Information and Computation
- Vol. 87 (1-2) , 264-301
- https://doi.org/10.1016/0890-5401(90)90064-o
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Fully abstract submodels of typed lambda calculiJournal of Computer and System Sciences, 1986
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977
- Data Types as LatticesSIAM Journal on Computing, 1976
- Expressibility of functions in D. Scott's LCF languageAlgebra and Logic, 1976