Full Abstraction for PCF
Top Cited Papers
- 1 December 2000
- journal article
- Published by Elsevier in Information and Computation
- Vol. 163 (2) , 409-470
- https://doi.org/10.1006/inco.2000.2930
Abstract
No abstract availableKeywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Projecting sequential algorithms on strongly stable functionsAnnals of Pure and Applied Logic, 1996
- Kripke Logical Relations and PCFInformation and Computation, 1995
- Proofs as processesTheoretical Computer Science, 1994
- Games and full completeness for multiplicative linear logicThe Journal of Symbolic Logic, 1994
- Sequential algorithms on concrete data structuresTheoretical Computer Science, 1982
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977