Games and Full Abstraction for FPC
- 1 July 2000
- journal article
- Published by Elsevier BV in Information and Computation
- Vol. 160 (1-2), 1-61
- https://doi.org/10.1006/inco.1999.2845
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Game SemanticsPublished by Springer Science and Business Media LLC ,1999
- Games and Definability For FPCBulletin of Symbolic Logic, 1997
- Relational Properties of DomainsInformation and Computation, 1996
- Kripke Logical Relations and PCFInformation and Computation, 1995
- Fully Abstract Semantics for Observably Sequential LanguagesInformation and Computation, 1994
- Games and full completeness for multiplicative linear logicThe Journal of Symbolic Logic, 1994
- I-Categories as a framework for solving domain equationsTheoretical Computer Science, 1993
- Linear logicTheoretical Computer Science, 1987
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977