Fully abstract submodels of typed lambda calculi
- 31 August 1986
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 33 (1) , 2-46
- https://doi.org/10.1016/0022-0000(86)90041-3
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The congruence of two programming language definitionsTheoretical Computer Science, 1981
- Infinite trees in normal form and recursive equations having a unique solutionTheory of Computing Systems, 1979
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977