A categorical semantics of higher order store

Electronic Notes in Theoretical Computer Science

Volumn 69, Issue , 2003, Pages 209-226

  Laird, J ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; FORMAL LANGUAGES; FUNCTIONS; MATHEMATICAL MODELS; TENSORS; THEOREM PROVING;

AXIOMS; CATEGORICAL SEMANTICS; FUNCTIONAL LANGUAGES; MONOIDAL CATEGORY;

SEMANTICS;

EID: 18944390710     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80566-8     Document Type: Conference Paper

References (20)

1. Abramsky S. Axioms for full abstraction and full completeness. Essays in Honour of Robin Milner. 1997;MIT Press
2. Abramsky S., McCusker G. Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions. O'Hearn P.W., Tennent R. Algol-like languages. 1997;Birkhauser
3. S. Abramsky, K. Honda, G. McCusker. A fully abstract games semantics for general references. In Proceedings of the 13th Annual Symposium on Logic In Computer Science, LICS '98, 1998.
4. Abramsky S., Jagadeesan R., Malacaria P. Full abstraction for PCF. Information and Computation. 163:2000;409-470
5. P. Baillot. Approches Dynamiques en Seḿantique de la Logique Linéaire: Jeux et Géométrie de l'Interaction. PhD thesis, Université d'Aix-Marseille II, 1999.
6. Josh Berdine, Peter W. O'Hearn, Uday S. Reddy, and Hayo Thielecke. Linearly used continuations. In Informal Proceedings of The Third ACM SIGPLAN Workshop on Continuations (CW'01), January 2001. To appear.
7. G. Bierman. What is a categorical model of intuitionistic linear logic? In Proceedings of the Second International Conference on Typed Lambda Calculus, number 902 in LNCS, 1995.
8. D. Ghica and G. McCusker. Reasoning about Idealised Algol using regular languages. In Proceedings of the Twenty-Seventh International Colloquium on Automata, Languages and Programming (ICALP 2000), 2000.
9. R. Harmer and G. McCusker. A fully abstract games semantics for finite non-determinism. In Proceedings of the Fourteenth Annual Symposium on Logic in Computer Science, LICS '99. IEEE Computer Society Press, 1998.
10. M. Hasegawa. Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In Proceedings of TLCA '97, number 1210 in LNCS, pages 196-213. Springer, 1997.
11. Hyland J.M.E., Ong C.-H.L. On full abstraction for PCF: I, II and III. Information and Computation. 163:2000;285-408
12. Joyal A., Street R., Verity D. Traced monoidal categories. Math. Proc. Camb. Phil. Soc. 119:1996;447-468
13. J. Laird. A Semantic Analysis of Control. PhD thesis, Department of Computer Science, University of Edinburgh, 1998.
14. J. Laird. A fully abstract game semantics of local exceptions. In Proceedings of the Sixteenth International Symposium on Logic In Computer Science, LICS '01. IEEE Computer Society Press, 2001.
15. J. Laird. A game semantics of ICSP. In Proceedings of MFPS XVII, number 45 in Electronic notes in Theoretical Computer Science. Elsevier, 2001.
16. G. McCusker. Games and full abstraction for a functional metalanguage with recursive types. PhD thesis, Imperial College London, 1996.
17. Pitts A.M. Relational properties of domains. Information and Computation. 127:1996;66-90
18. Power J., Robinson E. Premonoidal categories and notions of computation. Mathematical Structures in Computer Science. 1997
19. U. Reddy. A linear logic model of state. Typescript, 1993.
20. th ACM Symposium on Principles of Programming Languages, pages 39-46, 1978.