Designs, disputes and strategies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2471, Issue , 2002, Pages 442-457

  Faggian, Claudia ^a   Hyland, Martin ^a  

^a DPMMS University of Cambridge   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

GAMES SEMANTICS; PROOF THEORY;

COMPUTER CIRCUITS;

EID: 23044534694     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45793-3_30     Document Type: Conference Paper

References (9)

1. [1] S. Abramsky, K. Honda, and G. McCusker. A fully abstract game semantics for general references. In Proceedings LICS’98. IEEE Computer Society Press, 1998.
2. [2] S. Abramsky and G. McCusker. Computational Logic, chapter Game semantics. Springer-Verlag, 1999.
3. [3] V. Danos, H. Herbelin, and L. Regnier. Games semantics and abstract machines. In Proceedings LICS’96. IEEE Computer Society Press, 1996.
4. [4] C. Faggian. On the Dynamics of Ludics. A Study of Interaction. PhD thesis, Université Aix-Marseille II, 2002.
5. [5] J.-Y. Girard. Geometry of interaction i: Interpretation of system f. In Z.A. Ferro R.m Bonotto C., Valentini S., editor, Logic Colloquium 88, pages 221–260. North Holland, 1989.
6. [6] J.-Y. Girard. Locus solum. Mathematical Structures in Computer Science, 2001.
7. [7] M. Hyland and L. Ong. On full abstraction for PCF. Information and Computation, 2000.
8. [8] M. Hyland and A. Schalk. Abstract Games for Linear Logic. Electronic Notes in Theoretical Computer Science, 29:1–24, 1999.
9. [9] H. Nickau. Hereditarily sequential functionals. In Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. Petersburg, LNCS. Springer, 1994.