Travelling on designs ludics dynamics

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

Volumn 2471, Issue , 2002, Pages 427-441

  Faggian, Claudia ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS);

ABSTRACT MACHINES; CUT ELIMINATION; PROOF NET; SEQUENT CALCULUS;

COMPUTER CIRCUITS;

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

References (8)

1. [1] J.-M. Andreoli and R. Pareschi. Linear objects: logical processes with built-in inheritance. New Generation Computing, 9(3-4):445–473, 1991.
2. [2] T. Coquand. A semantics of evidence for classical arithmetic. Journal of Symbolic Logic, (60), 1995.
3. [3] P.-L. Curien and H. Herbelin. Computing with abstract bohm trees. In Third Fuji International Conference on Functional and Logic Programming, Kyoto, 1998. Word Scientific.
4. [4] C. Faggian. On the Dynamics of Ludics. A Study of Interaction. PhD thesis, Universit´e Aix-Marseille II, 2002.
5. [5] C. Faggian and M. Hyland. Designs, disputes and strategies. In CSL 2002 (this volume), LNCS. Springer, 2002.
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] H. Nickau. Hereditarily sequential functionals. In Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. Petersburg, LNCS. Springer, 1994.