L-nets, strategies and proof-nets

Lecture Notes in Computer Science

Volumn 3634, Issue , 2005, Pages 167-183

  Curien, Pierre Louis ^a   Faggian, Claudia ^b  

^a CNRS   (France)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; FORMAL LANGUAGES; INTERACTIVE COMPUTER SYSTEMS; MATHEMATICAL MODELS; TREES (MATHEMATICS);

CONCURRENT INTERACTIONS; GIRARD'S LUDICS; L-NETS; TREE-LIKE STRATEGIES;

GAME THEORY;

EID: 26944501931     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538363_13     Document Type: Conference Paper

References (14)

1. R. Amadio and P.-L. Curien. Domains and Lambda-calculi. Cambridge University Press, 1998.
2. J.-M. Andreoli. Focussing and proof construction. Annals of Pure and Applied Logic, 2001.
3. J.-M. Andreoli. Focussing proof-net construction as a middleware paradigm. In Proceedings of Conference on Automated Deduction (CADE), 2002.
4. P.-L. Curien. Abstract bohm trees. MSCS, 8(6), 1998.
5. P.-L. Curien. Introduction to linear logic and ludics, part ii. to appear in Advances of Mathematics, China, available at www.pps.jussieu.fr/curien, 2004.
6. C. Faggian. Travelling on designs: ludics dynamics. In CSL'02, volume 2471 of LNCS. Springer Verlag, 2002.
7. C. Faggian and M. Hyland. Designs, disputes and strategies. In CSL'02, volume 2471 of LNCS. Springer Verlag, 2002.
8. C. Faggian and F. Maurel. Ludics nets, a game model of concurrent interaction. In Proc. of LICS (Logic in Computer Science). IEEE Computer Society Press, 2005.
9. J.-Y. Girard. Linear logic. Theoretical Computer Science, (50):1-102, 1987.
10. J.-Y. Girard. On the meaning of logical rules i: syntax vs. semantics. In Berger and Schwichtenberg, editors, Computational logic, NATO series F 165, pages 215-272. Springer, 1999.
11. J.-Y. Girard. Locus solum. MSCS, 11:301-506, 2001.
12. D. Hughes and R. van Glabbeek. Proof nets for unit-free multiplicative-additive linear logic. ACM Transactions on Computational Logic, 2005.
13. M. Hyland and L. Ong. On full abstraction for PCF. Information and Computation, 2000.
14. O. Laurent. Etude de la polarisation en logique. PhD thesis, 2002.