Infinite Trace Equivalence

Electronic Notes in Theoretical Computer Science

Volumn 155, Issue 1 SPEC. ISS., 2006, Pages 467-496

  Levy, Paul Blain ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

game semantics; infinite traces; nondeterminism

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; GAME THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS; THEOREM PROVING;

DENOTATIONAL MODELS; GAME SEMANTICS; INFINITE TRACES; NONDETERMINISM;

COMPUTER PROGRAMMING;

EID: 33646231754     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.11.069     Document Type: Article

References (18)

1. Abramsky, S., K. Honda and G. McCusker, A fully abstract game semantics for general references, in: Proc., 13th Ann. IEEE Symp. on Logic in Comp. Sci., 1998
2. Brookes S. The essence of Parallel Algol. Information and Computation 179 (2002)
3. Danos V., Herbelin H., and Regnier L. Game semantics and abstract machines. Proc., 11th Annual IEEE Symposium On Logic In Computer Science 1996 (1996)
4. Escardó, M., A metric model of PCF (1998), unpublished research note
5. Felleisen M., and Friedman D. Control operators, the SECD-machine, and the λ-calculus. In: Wirsing M. (Ed). Formal Description of Prog. Concepts (1986), North-Holland
6. Harmer, R. and G. McCusker, A fully abstract game semantics for finite nondeterminism, in: Proc., 14th Ann. IEEE Symp. on Logic in Comp. Sci., 1999
7. Hasegawa, M, "Models of sharing graphs :-a categorical semantics of let and letrec," Ph.D. thesis, University of Edinburgh (1997)
8. Hyland M., and Ong L. On full abstraction for PCF: I, II, and III. Inf. and Comp. 163 (2000)
9. Jonsson B. A fully abstract trace model for dataflow and asynchronous networks. Distributed Computing 7 (1994) 197-212
10. Levy, P.B., Infinite trace semantics, Proc., 2nd APPSEM II Workshop, Tallinn, April, 2004 www.cs.ioc.ee/appsem04/accepted.html
11. Levy P.B. Call-By-Push-Value. A Functional/Imperative Synthesis. Semantic Structures in Computation (2004), Springer
12. Levy P.B. Adjunction models for call-by-push-value with stacks. Theory and Applications of Categories 14 (2005) 75-110
13. McCusker, G., "Games and Full Abstraction for a Functional Metalanguage with Recursive Types," Ph.D. thesis, University of London (1996)
14. Moggi E. Notions of computation and monads. Inf. and Comp. 93 (1991)
15. Plotkin, G., Domains (1983), prepared by Y. Kashiwagi, H. Kondoh and T. Hagino
16. Plotkin G., and Power J. Notions of computation determine monads. Proc., Foundations of Software Sci. and Comp. Struct. 2002. LNCS 2303 (2002)
17. Roscoe A.W. Theory and Practice of Concurrency (1998), Prentice-Hall
18. Roscoe, A.W., Seeing beyond divergence (2004), presented at BCS FACS meeting "25 Years of CSP"