Geometry of Interaction and linear combinatory algebras

Mathematical Structures in Computer Science

Volumn 12, Issue 5, 2002, Pages 625-665

  Abramsky, Samson ^a   Haghverdi, Esfandiar ^b   Scott, Philip ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18944405125     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129502003730     Document Type: Article

References (58)

1. Abramsky, S. (1994) Proofs as processes. Theoretical Computer Science 135 5-9.
2. Abramsky, S. (1996) Retracing Some Paths in Process Algebra. CONCUR 96. Springer-Verlag Lecture Notes in Computer Science 1119 1-17.
3. Abramsky, S. (1997) Interaction, Combinators and Complexity (lecture notes, Siena, Italy).
4. Abramsky, S., Blute, R., Panangaden, P. (1999) Nuclear and Traced Ideals in Tensored *-categories. J. Pure and Applied Algebra 143 3-47.
5. Abramsky, S., Gay, S., Nagarajan, R., (1996) Specication structures and propositions-as-types for concurrency. Structure vs. Automata. Springer-Verlag Lecture Notes in Computer Science 1043.
6. Abramsky, S., Haghverdi, E., Scott, P. (2001) Geometry of Interaction and Linear Combinatory Algebras (Extended Version). Oxford University Computing Laboratory Technical Report RR-01-10. http://web.comlab.ox.ac.uk/oucl/publications/tr/rr-01-10.html.
7. Abramsky S., Jagadeesan, R., (1994) Games and full completeness for multiplicative linear logic. J. Symbolic Logic 59 (2) 543-574.
8. Abramsky, S., Jagadeesan, R., (1994) New Foundations for the Geometry of Interaction. Information and Computation 111 (1) 53-119.
9. Abramsky, S., Jagadeesan, R., Malacaria, P., CSL2000. Springer-Verlag Lecture Notes in Computer Science, (2000) Full Abstraction for PCF. Information and Computation 163 (2) 409-470.
10. Abramsky, S., Lenisa, M., (2000) A Fully Complete PER Model for ML Polymorphic Types. CSL2000. Springer-Verlag Lecture Notes in Computer Science, 1862.
11. Abramsky, S., Longley, J., (2000) Realizability models based on history-free strategies (manuscript). 14th Annual IEEE Symp. on Logic in Computer Science (LICS)
12. Abramsky, S., Mellies, PA., (1999) Concurrent Games and Full Completeness. 331-342.
13. Aczel, P., (1988) Non-well-founded sets, CSLI publications.
14. Asperti, A., Longo, G., (1991) Categories, Types, and Structures, MIT Press.
15. Avron, A., (1988) The semantics and proof theory of linear logic. Theoretical Computer Science 57 161-184.
16. Baillot, P., (1995) Abramsky-Jagadeesan-Malacaria strategies and the geometry of interaction, memoire de DEA, Universite Paris Information and Control, Universite Paris 7, 1995. http://www.dcs.ed.ac.uk/home/pb/.
17. Baillot, P., Pedicini, M., (2000) Elementary Complexity and Geometry of Interaction (preprint).
18. Bainbridge, E.S., (1976) Feedback and Generalized Logic. Information and Control 31 75-96.
19. Barendregt, H.P., (1984) The Lambda Calculus, Studies in Logic 103, North-Holland.
20. Barr, M., (1993) Terminal coalgebras in well-founded set theory. Theoretical Computer Science 114 299-315.
21. Bierman, G.M., Dezani-Ciancaglini, M., Plotkin, G., (1995) What is a categorical model of intuitionistic linear logic? TLCA'95 78-93.
22. Bloom, S.L., Esik, Z., (1993). Iteration theories; the equational logic of iterative processes, Springer-Verlag.
23. Blute, R., Cockett, R., Seely, R., (2000) Feedback for linearly distributive categories: traces and xpoints. J. Pure and Applied Algebra 154 27-69.
24. Danos, V., Regnier, L., (1993) Local and Asynchronous beta-reduction (An analysis of GirardWs Execution Formula). Springer-Verlag Lecture Notes in Computer Science 8 296-306.
25. Danos, V., Regnier, L., Girard, J.Y., Lafont, Y., Regnier, L.,(1995) Proof-nets and the Hilbert space. Advances in Linear Logic, London Math. Soc. Series 222, Cambridge University Press 307-328.
26. Girard, J.Y., (1987) Linear Logic. Theoretical Computer Science 50 (1) 1-102.
27. Girard, J.Y., Ferro, R., (1989) Geometry of Interaction I: Interpretation of System F. Logic Colloquium '88, North-Holland 221-260.
28. Girard, J.Y., Martin-Lof, P., Mints, G., (1990) Geometry of Interaction II: Deadlock-free Algorithms. COLOG-88. Springer-Verlag Lecture Notes in Computer Science 417 76-93.
29. Girard, J.Y., Girard, J.Y., Lafont, Y., Regnier, L., (1995) Geometry of Interaction III: Accommodating the Additives. Advances in Linear Logic, London Math. Soc. Series 222, Cambridge University Press 1-42.
30. Giry, M., (1981) A categorical approach to probability theory. Springer-Verlag Lecture Notes in Mathematics 915 68-85.
31. Gonthier, G., Abadi, M., Levy, J.J., (1992) The geometry of optimal lambda reduction. 9th Annual IEEE Symp. on Logic in Computer Science (LICS) 15-26.
32. Haghverdi, E., (2001) Partially Additive Categories and Fully Complete Models of Linear Logic In: Proceedings of Typed Lambda Calculi and Applications (TLCA'01). Springer-Verlag Lecture Notes in Computer Science 2044 197-216.
33. Haghverdi, E., (2000) A Categorical Approach to Linear Logic, Geometry of Proofs and Full Completeness, Ph. D. Thesis, University of Ottawa.
34. Haghverdi, E., (2000) Unique Decomposition Categories, Geometry of Interaction, and Combinatory Logic. Mathematical Structures in Computer Science 10 205-231.
35. Hasegawa, M., Models of sharing graphs, Ph.D. Thesis, University of Edinburgh.
36. Hindley, R., (1997) Basic Simple Type Theory, Cambridge Tracts in Theoretical Computer Science 42, Cambridge University Press.
37. Hines, P.M., (1997) The algebra of self-similarity and its applications, Ph.D. Thesis, University of Wales.
38. Hines, P.M., (1999) The categorical theory of self-similarity. Theory and Applications of Categories 6.
39. Hines, P.M., (2000) Advances in Math, A hierarchy of Lnite state machines and their algebraic models. http://www.bangor.ac.uk/max003/tmtrans.ps.
40. Joyal, A., Street, R., (1991) The geometry of tensor calculus I. Advances in Math 88 55-113.
41. Joyal, A., Street, R., Verity, D., (1996) Traced Monoidal Categories. Math. Proc. Camb. Phil. Soc. 119 447-468.
42. Lawvere, F.W., (1963),World Scientic Press, The category of probabilistic mappings (preprint).
43. Lawson, M.V., (1998) Inverse Semigroups, World Scientic Press.
44. Loader, R., (1994) Models of Lambda Calculi and Linear Logic: Structural, equational and prooftheoretic characterisations, Ph.D. Thesis, St. Hugh's College, Oxford.
45. Longley, J., (1995) Realizability Toposes and Language Semantics, Ph.D. Thesis, University of Edinburgh.
46. Longley, J., (1998) Realizability Models for Sequential Computation, manuscript from APPSEM'98 Workshop. http://www.dcs.ed.ac.uk/home/jrl.
47. Mac Lane, S., (1998) Categories for the Working Mathematician, Graduate Texts in Mathematics 5, 2nd edition, Springer-Verlag.
48. Mackie, I., (1994) The Geometry of Implementation, Ph.D. Thesis, Imperial College, University of London.
49. Mackie, I., (1998) Linear Logic with boxes. 13th Annual IEEE Symp. on Logic in Computer Science (LICS) 309-320.
50. Manes, E., Arbib, M., (1986) Algebraic Approaches to Program Semantics, Springer-Verlag.
51. Milner, R., (1975). Processes: a mathematical model of computing agents. Logic Colloq. '73, North-Holland 157-173.
52. Moggi, E., (1989) Computational lambda-calculus and monads. 4th Annual IEEE Symp. on Logic in Computer Science (LICS) 14-23.
53. Plotkin, G., (1976) A powerdomain construction. SIAM J. Computing 5 (3) 452-487.
54. Panangaden, P., (1997) Stochastic Techniques in Concurrency (lecture notes, BRICS, Aarhus, Denmark)Categories in Computer Science and Logic. Contemporary Mathematics 92, Am. Math. Soc.
55. Seely, R.A.G., Gray, J., Scedrov, A., (1989) Linear logic, *-autonomous categories and cofree coalgebras. Categories in Computer Science and Logic. Contemporary Mathematics 92, Am. Math. Soc.
56. Stefanescu, G., (2000) Network Algebra, Springer-Verlag.
57. Tan, A.M., (1997) Full Completeness for Models of Linear Logic, Ph.D. Thesis, Cambridge University.
58. Troelstra, A.S., (1992) Lectures on Linear Logic, Center for the Study of Language and Information Lecture Notes' 29.