Game-theoretic analysis of call-by-value computation
- 1 June 1999
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 221 (1-2) , 393-456
- https://doi.org/10.1016/s0304-3975(99)00039-0
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A calculus of mobile processes, IPublished by Elsevier ,2004
- Kripke Logical Relations and PCFInformation and Computation, 1995
- Games and full completeness for multiplicative linear logicThe Journal of Symbolic Logic, 1994
- Concrete domainsTheoretical Computer Science, 1993
- Functions as processesMathematical Structures in Computer Science, 1992
- A game semantics for linear logicAnnals of Pure and Applied Logic, 1992
- Notions of computation and monadsInformation and Computation, 1991
- Partial morphisms in categories of effective objectsInformation and Computation, 1988
- Linear logicTheoretical Computer Science, 1987
- Sequential algorithms on concrete data structuresTheoretical Computer Science, 1982