Towards a typed geometry of interaction

Mathematical Structures in Computer Science

Volumn 20, Issue 3, 2010, Pages 473-521

  Haghverdi, Esfandiar ^a   Scott, Philip ^b  

^a INDIANA UNIVERSITY   (United States)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT NOTIONS; CUT ELIMINATION; DYNAMICS OF CUT-ELIMINATION; GENERAL MODEL; GEOMETRY OF INTERACTION; GIRARD'S GEOMETRY OF INTERACTIONS; MATHEMATICAL FRAMEWORKS; MULTIOBJECT GOI; MULTIPLICATIVE EXPONENTIAL LINEAR LOGIC; MULTIPLICATIVE LINEAR LOGIC; NEW THEORY; ORTHOGONALITY;

EID: 77957271223     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096012951000006X     Document Type: Article

References (46)

1. Abramsky, S. (1996) Retracing Some Paths in Process Algebra. In: CONCUR'96. Springer-Verlag Lecture Notes in Computer Science 1119 1-17. (Pubitemid 126117751)
2. *-categories. J. Pure and Applied Algebra 143 3-47.
3. Abramsky, S., Haghverdi, E. and Scott, P. J. (2002) Geometry of Interaction and Linear Combinatory Algebras. Mathematical Structures in Computer Science 12(5) 625-665.
4. Abramsky, S. and Jagadeesan, R. (1994) New Foundations for the Geometry of Interaction. Information and Computation 111(1) 53-119. (Pubitemid 23562010)
5. Baillot, P. (1995) Abramsky-Jagadeesan-Malacaria strategies and the geometry of interaction. Mémoire de DEA, Universite Paris 7.
6. Baillot, P. and Pedicini, M. (2000) Elementary complexity and geometry of interaction. Fundamenta Informaticae 45 (1-2). (Pubitemid 32190569)
7. Blute, R., Cockett, R. and Seely, R. A. G. (2000) Feedback for linearly distributive categories: traces and fixpoints Bill (Lawvere) Fest. Journal of Pure and Applied Algebra 154 27-69.
8. Danos, V. (1990) La logique linéaire appliquée à l'étude de divers processus de normalisation et principalement du λ-calcul, Ph. D. thesis, Université Paris VII.
9. Danos, V. and Regnier, L. (1995) Proof-nets and the Hilbert Space. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in Linear Logic. London Math. Soc. Notes 222 307-328.
10. Doplicher, S. and Roberts, J. E. (1989) A New Duality for Compact Groups. Invent. Math. 98 157-218.
11. Fuhrman, C. and Pym, D. (2004) On the Geometry of Interaction for Classical Logic (Extended Abstract). Proc. LICS 04, IEEE Computer Society Press 211-220.
12. Girard, J.-Y. (1987) Linear Logic. Theoretical Computer Science 50(1) 1-102.
13. Girard, J.-Y. (1988) Geometry of Interaction II: Deadlock-free Algorithms. In Proc. of COLOG'88. Springer-Verlag Lecture Notes in Computer Science 417 76-93.
14. Girard, J.-Y. (1989) Geometry of Interaction I: Interpretation of System F. In: Proc. Logic Colloquium 88, North-Holland 221-260.
15. Girard, J.-Y. (1995) Geometry of Interaction III: Accommodating the Additives. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in Linear Logic. London Math. Soc. Notes 222 329-389
16. Girard, J.-Y. (2007). Le Point Aveugle (I, II), Hermann Éditeurs, Paris.
17. Girard, J.-Y. (2008) Geometry of Interaction V: logic in the hyperfinite factor (manuscript).
18. Girard, J.-Y., Lafont, Y. and Taylor, P. (1988) Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7.
19. *- categories. Pacific Journal of Math. 120 79-109.
20. Gonthier, G., Abadi, M. and Lévy, J.-J. (1992) The geometry of optimal lambda reduction. In: POPL'92: Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, ACM 15-26.
21. Haghverdi, E. (2000a) A Categorical Approach to Linear Logic, Geometry of Proofs and Full Completeness, Ph. D. Thesis, University of Ottawa, Canada.
22. Haghverdi, E. (2000b) Unique Decomposition Categories, Geometry of Interaction and combinatory logic. Mathematical Structures in Computer Science 10 205-231.
23. Haghverdi, E. (2006) Typed GoI for Exponentials. In: Bugliesi, M. et al. (eds.) Proc. of ICALP 2006, Part II. Springer-Verlag Lecture Notes in Computer Science 4052 384-395.
24. Haghverdi, E. and Scott, P. J. (2004a) A categorical model for the Geometry of Interaction. Theoretical Computer Science 350 (2-3) 252-274. (Preliminary Version in: Automata, Languages (Pubitemid 39203830)
25. Programming (ICALP 2004). Springer-Verlag Lecture Notes in Computer Science 3142 708-720.)
26. Haghverdi, E. and Scott, P. J. (2004b) From Geometry of Interaction to Denotational Semantics. Proceedings of CTCS2004. Electronic Notes in Theoretical Computer Science 122 67-87. (Pubitemid 40302711)
27. Haghverdi, E. and Scott, P. J. (2005) Towards a Typed Geometry of Interaction. In: Ong, L. (ed.) CSL2005 (Computer Science Logic). Springer-Verlag Lecture Notes in Computer Science 3634 216-231. (Pubitemid 41472656)
28. Haghverdi, E. and Scott, P. J. (2008) Proofs as polynomials. In: Bauer, A. and Mislove, M. (eds.) Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXIV). Electronic Notes in Theoretical Computer Science 218 53-72.
29. Haghverdi, E. and Scott, P. J. (2010) Geometry of Interaction and the Dynamics of Proof Reduction: a tutorial. In: Coecke, B. (ed.) New Structures for Physics. Springer-Verlag Lecture Notes in Physics 2010 339-397.
30. Hasegawa, M. (1997) Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculus. Springer-Verlag Lecture Notes in Computer Science 1210 196-213. (Pubitemid 127046880)
31. Hasegawa, M. (2009) On Traced Monoidal Closed Categories. Mathematical Structures in Computer Science 19(2) 217-244.
32. Hermida, C. and Mateus, P. (2003) Paracategories I: internal paracategories and saturated partial algebras. Theoretical Computer Science 109 135-156.
33. Hines, P. (2003) A categorical framework for finite state machines. Mathematical Structures in Computer Science 13 451-480. (Pubitemid 36631111)
34. Hyland, M and Schalk, A. (2003) Glueing and Orthogonality for Models of Linear Logic. Theoretical Computer Science 294 183-231.
35. Jeffrey, A. S. A. (1998) Premonoidal categories and a graphical view of programs (see the webpage: http://klee.cs.depaul.edu/premon/;
36. see also Electronic Notes in Theoretical Computer Science 10 (1997).)
37. Joyal, A., Street, R. and Verity, D. (1996) Traced Monoidal Categories. Math. Proc. Camb. Phil. Soc. 119 447-468. (Pubitemid 126031312)
38. Laurent, O. (2001) A Token Machine for Full Geometry of Interaction. In: Goos, G., Hartmanis, J. and van Leeuwen, J. (eds.) Proceedings: Typed Lambda Calculi and Applications, 5th International Conference, TLCA 2001 Krakw, Poland. Springer-Verlag Lecture Notes in Computer Science 2044 283-297. (Pubitemid 33275734)
39. Mac Lane, S. (1998) Categories for the Working Mathematician, 2nd Edition, Springer-Verlag.
40. Malacaria, P. and Regnier. L. (1991) Some Results on the Interpretation of Λ-calculus in Operator Algebras. In: Proc. LICS, IEEE Press 63-72. (Pubitemid 21691997)
41. Malherbe, O. (2010) Ph. D. thesis (in preparation), Dept. of Mathematics, U. Ottawa.
42. Plotkin, G. (2003) Trace Ideals, invited lecture at MFPS 2003, Montreal.
43. Regnier, L. (1992) Lambda-calcul et Réseaux, Ph. D. Thesis, Université Paris VII.
44. Schöpp, U. (2007) Stratified Bounded Affine Logic for Logarithmic Space. In: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS), IEEE 411-420.
45. Selinger, P. (2004a) Towards a typed quantum programming language. Mathematical Structures in Computer Science 14(4) 527-586. (Pubitemid 39142159)
46. Selinger, P. (2004b) In: Selinger, P. (ed.) Proceedings of the 2nd International Workshop on Quantum Programming Languages, TUCS General Publications 33, Turku Centre for Computer Science.