Infinite trace equivalence

Annals of Pure and Applied Logic

Volumn 151, Issue 2-3, 2008, Pages 170-198

  Levy, Paul Blain ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Game semantics; Infinite traces; Jump With Argument; Nondeterminism

Indexed keywords

EID: 38849152950     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2007.10.007     Document Type: Article

References (33)

1. Abramsky S. On semantic foundations for applicative multiprogramming. In: Díaz J. (Ed). Automata, Languages and Programming, 10th Colloquium. LNCS vol. 154 (1983), Springer-Verlag 1-14
2. S. Abramsky, K. Honda, G. McCusker, A fully abstract game semantics for general references, in: Proceedings, 13th Annual IEEE Symposium on Logic in Computer Science, 1998, pp. 334-344
3. Abramsky S., and McCusker G. Call-by-value games. In: Nielsen M., and Thomas W. (Eds). Computer Science Logic: 11th International Workshop Proceedings. LNCS (1998), Springer 1-17
4. Aczel P., Adámek J., Milius S., and Velebil J. Infinite trees and completely iterative theories: A coalgebraic view. Theoretical Computer Science 300 1-3 (2003) 1-45
5. Brookes S. The essence of Parallel Algol. Information and Computation 179 (2002)
6. Broy M. A theory for nondeterminism, parallelism, communication, and concurrency. Theoretical Computer Science 45 (1986) 1-61
7. Cattani G.L., and Winskel G. Presheaf models for CCS-like languages. Theoretical Computer Science 300 1-3 (2003) 47-89
8. M. Escardó, A metric model of PCF, 1998, unpublished research note
9. Ghani N., Lüth C., Marchi F.D., and Power J. Dualising initial algebras. Mathematical Structures in Computer Science 13 2 (2003) 349-370
10. Harmer R., and McCusker G. A fully abstract game semantics for finite nondeterminism. 14th Symposium on Logic in Computer Science. LICS'99 (1999), IEEE, Washington, Brussels, Tokyo 422-430
11. M. Hasegawa, Models of sharing graphs:-a categorical semantics of let and letrec, Ph.D. Thesis, University of Edinburgh, 1997
12. Hyland M., and Ong L. On full abstraction for PCF: I, II, and III. Information and Computation 163 2 (2000)
13. Jonsson B. A fully abstract trace model for dataflow and asynchronous networks. Distributed Computing 7 4 (1994) 197-212
14. Lassen S.B., and Levy P.B. Typed normal form bisimulation. 6th EACSL Annual Conference on Computer Science Logic, 2007. LNCS vol.~4646 (2007), Springer 283-297
15. Levy P.B. Call-by-push-value. A functional/imperative synthesis. Semantic Struct. in Computation (2004), Springer
16. P.B. Levy, Infinite trace semantics, in: Proc. 2nd APPSEM II Workshop, Tallinn, Estonia, April 2004
17. Levy P.B. Adjunction models for call-by-push-value with stacks. Theory and Applications of Categories 14 (2005) 75-110
18. Levy P.B. Call-by-push-value: Decomposing call-by-value and call-by-name. Higher-Order and Symbolic Computation 19 4 (2006) 377-414
19. Levy P.B. Infinite trace equivalence. Proceedings, 21st Annual Conference in Mathematical Foundations of Computer Science. Birmingham, UK, 2005. ENTCS vol. 155 (2006) 467-496
20. G. McCusker, Games and full abstraction for a functional metalanguage with recursive types, Ph.D. Thesis, University of London, 1996
21. Møgelberg R., and Simpson A. Relational parametricity for computational effects. Proceedings, 22nd IEEE Symposium in Logic in Computer Science (2007), IEEE Computer Society 346-355
22. Moggi E. Notions of computation and monads. Information and Computation 93 (1991) 55-92
23. Moss L.S. Parametric corecursion. Theoretical Computer Science 260 1-2 (2001) 139-163
24. H. Nickau, Hereditarily sequential functionals: A game-theoretic approach to sequentiality, Shaker-Verlag, diss., Universität Gesamthochschule Siegen, 1996
25. Panangaden P., and Russell J.R. A category-theoretic semantics for unbounded indeterminacy. Proceedings, 5th Conference on Mathematical Foundations of Programming Semantics. New Orleans. LNCS vol. 442 (1989) 319-332
26. Pitts A.M. Relational properties of domains. Information and Computation 127 (1996) 66-90
27. G. Plotkin, Domains, prepared by Y. Kashiwagi, H. Kondoh and T. Hagino, 1983
28. Plotkin G., and Power J. Adequacy for algebraic effects. LNCS vol. 2030 (2001)
29. Plotkin G., and Power J. Notions of computation determine monads. Proceedings, Foundations of Software Science and Computation Structures, 2002. LNCS vol. 2303 (2002), Springer 342-356
30. Plotkin G.D., and Power A.J. Algebraic operations and generic effects. Applied Categorical Structures 11 1 (2003) 69-94
31. Roscoe A.W. Theory and Practice of Concurrency (1998), Prentice-Hall
32. A.W. Roscoe, Seeing beyond divergence, Presented at BCS FACS Meeting 25 Years of CSP, July 2004
33. Streicher T., and Reus B. Classical logic, continuation semantics and abstract machines. Journal of Functional Programming 8 6 (1998) 543-572