A fully abstract game semantics for finite nondeterminism
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Games and full abstraction for FPCPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Believe it or not, AJM's games model is a model of classical linear logicPublished 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
- Full Abstraction for PCFInformation and Computation, 2000
- On Full Abstraction for PCF: I, II, and IIIInformation and Computation, 2000
- Full abstraction for Idealized Algol with passive expressionsTheoretical Computer Science, 1999
- Linearity, Sharing and State: A Fully Abstract Game Semantics for Idealized Algol with Active ExpressionsPublished by Springer Nature ,1997
- Hereditarily sequential functionalsPublished by Springer Nature ,1994
- Countable nondeterminism and random assignmentJournal of the ACM, 1986
- A mathematical semantics for a nondeterministic typed λ-calculusTheoretical Computer Science, 1980