Full abstraction for the second order subset of an Algol-like language
- 10 November 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 168 (1) , 155-212
- https://doi.org/10.1016/s0304-3975(96)00066-7
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Kripke Logical Relations and PCFInformation and Computation, 1995
- Parametricity and local variablesJournal of the ACM, 1995
- The Formal Semantics of Programming LanguagesPublished by MIT Press ,1993
- Semantical analysis of specification logicInformation and Computation, 1990
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977
- A Powerdomain ConstructionSIAM Journal on Computing, 1976
- A correspondence between ALGOL 60 and Church's Lambda-notationsCommunications of the ACM, 1965
- Correspondence between ALGOL 60 and Church's Lambda-notationCommunications of the ACM, 1965