Games and full abstraction for FPC
- 24 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 174-183
- https://doi.org/10.1109/lics.1996.561316
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Relational properties of recursively defined domainsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Games and full abstraction for the lazy /spl lambda/-calculusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Kripke Logical Relations and PCFInformation and Computation, 1995
- Hereditarily sequential functionalsPublished by Springer Nature ,1994
- Full Abstraction for PCF (extended abstract)Lecture Notes in Computer Science, 1994
- Algebraically complete categoriesLecture Notes in Mathematics, 1991
- A note on inconsistencies caused by fixpoints in a cartesian closed categoryTheoretical Computer Science, 1990
- Linear logicTheoretical Computer Science, 1987
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977