Elementary complexity and geometry of interaction

Fundamenta Informaticae

Volumn 45, Issue 1-2, 2001, Pages 1-31

  Baillot, Patrick ^a   Pedicini, Marco ^b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; FORMAL LOGIC; LINEAR ALGEBRA; THEOREM PROVING;

ELEMENTARY LINEAR LOGIC;

COMPUTATIONAL GEOMETRY;

EID: 0035119256     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Baillot, P.: Stratified coherent spaces: a denotational semantics for Light Linear Logic, Technical Report EDI-INF-RR-0025, Division of Informatics, University of Edinburgh, august 2000. Extended abstract presented at the 2nd international Workshop on Implicit Computational Complexity, Santa Barbara, June 2000.
2. Danos, V.: La Logique Linéaire appliquée àl 'étude de divers processus de normalisation (principalement du λ-calcul), Ph.D. Thesis, Université Paris VII, Juin 1990.
3. Danos, V., Joinet, J.-B.: Elementary recursive functions and linear logic, 1999. Presented at the international workshop Implicit Computational Complexity'99
4. Danos, V., Regnier, L.: Proof nets and the Hilbert space, Advances in Linear Logic (J.-Y. Girard, Y. Lafont, L. Regnier, Eds.), Cambridge University Press, 1995, 307-328. London Mathematical Society Lecture Note Series 222, Proceedings of the 1993 Workshop on Linear Logic, Cornell University, Ithaca
5. Girard, J.-Y.: Linear Logic, Theoretical Computer Science, 50, 1987, 1-102.
6. Girard, J.-Y: Geometry of Interaction I: an Interpretation of System F, Proceedings of A.S.L. Meetings (Ferro, al, Eds.), North-Holland, Padova, 1988.
7. Girard, J.-Y: Geometry of interaction II: Deadlock Free Algorithms, in: Proceedings of COLOG'88 (Martin-Löf, Mints, Eds.), vol. 417 of Lecture Notes in Computer Science, Springer Verlag, 1988, 76-93.
8. Girard, J.-Y: Towards a Geometry of Interaction, Categories in Computer Science and Logic (J. W. Gray, A. Scedrov, Eds.), American Mathematical Society, 1989, 69-108. Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference, June 14-20, 1987, Boulder, Colorado; Contemporary Mathematics Volume 92
9. Girard, J.-Y: Quantifiers in Linear Logic II, Nuovi problemi della logica e della filosofia della scienza, Volume II (G. Corsi, G. Sambin, Eds.), CLUEB, Bologna(Italy), 1991. Proceedings of the conference with the same name, Viareggio, 8-13 gennaio 1990
10. Girard, J.-Y: Geometry of interaction 3: the general case, Advances in Linear Logic (J.-Y Girard, Y. Lafont, L. Regnier, Eds.), Cambridge University Press, 1995, 329-389. London Mathematical Society Lecture Note Series 222, Proceedings of the 1993 Workshop on Linear Logic, Cornell University, Ithaca
11. Girard, J.-Y: Proof-nets: the parallel syntax for proof theory, in: Logic and algebra (Pontignano, 1994), vol. 180 of Lecture Notes in Pure and Appl. Math., Dekker, New York, 1996, 97-124.
12. Girard, J.-Y: Light Linear Logic, Information and Computation, 143, 1998, 175-204.
13. Kanovich, M. L, Okada, M., Scedrov, A.: Phase semantics for light linear logic (extended abstract), in: Mathematical foundations of programming semantics (Pittsburgh, PA, 1997), vol. 6 of Electron. Notes Theor. Comput. Sci., Eisevier, Amsterdam, 1997.
14. Malacaria, P., Regnier, L.: Some Results on the Interpretation of A-calculus in Operator Algebras, Proceedings of the Sixth Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, 1991, 63-72.
15. Pedicini, M.: Remarks on Elementary Linear Logic, A Special Issue on the "Linear Logic 96, Tokyo Meeting", 3, Elsevier, Amsterdam, The Netherlands, 1996.
16. Regnier, L.: Lambda-Calcul et réseaux, Ph.D. Thesis, Université Paris VII, 1992.