Linear Läuchli semantics

Annals of Pure and Applied Logic

Volumn 77, Issue 2, 1996, Pages 101-142

  Blute, R F ^a   Scott, P J ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030605354     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(95)00017-8     Document Type: Article

References (49)

1. [1] K. Abé, Hopf Algebras (Cambridge Univ. Press, Cambridge, 1977).
2. [2] S. Abramsky and R. Jagadeesan, Games and full completeness for multiplicative linear logic, J. Symbolic Logic 59 (1994) 543-574.
3. [3] S. Abramsky, R. Jagadeesan and P. Malacaria, Games and full abstraction for PCF, Parts I, II. Research announcements (July, September 1993), Imperial College, London.
4. [4] V.M. Abrusci, Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic, J. Symbolic Logic 56 (1991) 1403-1456.
5. [5] E. Bainbridge, P. Freyd, A. Scedrov and P. Scott, Functorial polymorphism, Theoret. Comput. Sci. 70 (1990) 1403-1456.
6. [6] M. Barr, Duality of vector spaces, Cahiers de Top. et Géom. Diff. 17 (1976) 3-14.
7. [7] M. Barr, *-Autonomous Categories, Lecture Notes in Mathematics, Vol. 752 (Springer, Berlin, 1980).
8. [8] M. Barr, Separability of tensor in Chu categories of vector spaces, Appendix to [10].
9. [9] R. Blute, Linear logic, coherence and dinaturality, Theoret. Comput. Sci. 115 (1993) 3-41.
10. [10] R. Blute, Hopf algebras and linear logic, Math. Struct. Comput. Sci. (1995), to appear.
11. [11] R. Blute, Braided proof nets and categories, in preparation.
12. [12] R. Blute, J.R.B. Cockett, R.A.G. Seely and T. Trimble, Natural deduction and coherence for weakly distributive categories, J. Pure Appl. Algebra, to appear.
13. [13] J.R.B. Cockett and R.A.G. Seely, Weakly distributive categories, in: Applications of Categories in Computer Science, London Mathematical Society Lecture Notes Series, Vol. 177 (1992).
14. [14] V. Danos and L. Regnier, The structure of multiplicatives, Arch. Math. Logic 28 (1989) 181-203.
15. [15] A. Fleury and C. Rétoré, The MIX rule, preprint, 1991.
16. [16] P.J. Freyd, E.P. Robinson and G. Rosolini, Dinaturality for free, in: M.P. Fourman, P. Johnstone and A.M. Pitts, eds., Applications of Categories in Computer Science (Cambridge Univ. Press, Cambridge, 1992) 107-118.
17. [17] P.J. Freyd, E.P. Robinson and G. Rosolini, Functorial parametricity, Proc. Logic in Computer Science (IEEE Press, New York, 1992).
18. [18] W. Fulton and J. Harris, Representation Theory. Graduate Texts in Mathematics, Vol. 129 (Springer, Berlin, 1991).
19. [19] J.Y. Girard, Linear logic, Theoret. Comput. Sci. 50 (1987) 1-102.
20. [20] J.Y. Girard and Y. Lafont, Linear Logic and Lazy Computation, Lecture Notes in Computer Science, Vol. 250 (Springer, Berlin, 1988).
21. [21] J.Y. Girard, Y. Lafont and P. Taylor, Proofs and Types, Cambridge Tracts in Theoretical Computer Science, Vol. 7 (1989).
22. [22] J.Y. Girard, A. Scedrov and P. Scott, Normal forms and cut-free proofs as natural transformations, in: Logic From Computer Science, Mathematical Science Research Institute Publications 21 (1991), 217-241 (also available by anonymous ftp from: theory.doc.ic.ac.uk. in: papers/Scott).
23. [23] V. Harnik and M. Makkai, Lambek's categorical proof theory and Läuchli's abstract realizability, J. Symbolic Logic 57 (1992) 200-230.
24. [24] J. Horvath, Topological Vector Spaces and Distributions, Addison-Wesley Series in Mathematics (1966).
25. [25] P. Johnstone, Topos Theory (Academic Press, New York, 1977).
26. [26] G.M. Kelly and M. La Plaza, Coherence for compact closed categories, J. Pure Appl. Algebra 19 (1980) 193-213.
27. [27] G.M. Kelly and S. Mac Lane, Coherence in closed categories, J. Pure Appl. Algebra 1 (1971) 97-140.
28. [28] J. Lambek, Bilinear logic in algebra and linguistics, preprint, 1993.
29. [29] J. Lambek and P.J. Scott, Introduction to Higher Order Categorical Logic (Cambridge Univ. Press, Cambridge, 1986).
30. [30] H. Läuchli, An abstract notion of realizability for which intuitionistic predicate calculus is complete, in: A. Kino et al., eds., Intuitionism and Proof Theory (North-Holland, Amsterdam, 1970) 227-234.
31. [31] S. Lefschetz, Algebraic Topology, American Mathematical Society Colloquium Publications 27 (1963).
32. [32] R. Loader, The undecidability of λ-definability, manuscript, 1993 (available by anonymous ftp from theory.doc.ic.ac.uk, in: papers/Loader).
33. [33] R. Loader, Linear logic, totality and full completeness, Proc. Logic in Computer Science (LICS) 1994 (IEEE Computer Science Press, Silver Spring, MD, 1994).
34. [34] S. Majid, Quasitriangular Hopf algebras and Yang-Baxter equations, Internat. J. Modern Phys. 5 (1990) 1-91.
35. [35] R. Milner, Fully abstract models of typed Lambda calculi, Theoret. Comput. Sci. 4 (1977) 1-22.
36. [36] J.C. Mitchell, Type systems for programming languages, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990) 365-458.
37. [37] J.C. Mitchell and E. Moggi, Kripke-style models for typed lambda calculus, Ann. Pure Appl. Logic 51 (1991) 99-124.
38. [38] J.C. Mitchell and A. Scedrov, Notes on sconing and relators, Computer Science Logic '92, Lecture Notes in Computer Science, Vol. 702 (Springer, Berlin, 1993) 352-378.
39. [39] J.C. Mitchell and P.J. Scott, Typed lambda models and Cartesian closed categories, Contemp. Math. 92 (1989) 301-316.
40. [40] G.D. Plotkin, Lambda definability in the full type hierarchy, To H.B. Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism (1980) 363-373.
41. [41] J. Reynolds, Types, abstraction and parametric polymorphism, Information Processing '83 (North-Holland, Amsterdam, 1983).
42. [42] H.H. Schaefer, Topological Vector Spaces, Graduate Texts in Mathematics, Vol. 3 (Springer, Berlin, 1970).
43. [43] R.A.G. Seely, Linear logic, *-autonomous categories, and cofree coalgebras, Contemp. Math. 92 (1989) 371-382.
44. [44] R. Statman, Logical relations and the typed Lambda calculus, Inform. and Control 65 (1985) 85-97.
45. [45] A. Stoughton, Mechanizing logical relations, Proc. Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science, Vol. 802 (Springer Berlin, 1994).
46. [46] M. Sweedler, Hopf Algebras (Benjamin Press, New York, 1969).
47. [47] W.W. Tait, Intensional interpretation of functionals of finite type, J. Symbolic Logic 32 (1967) 198-212.
48. [48] A. Troelstra, Lectures on Linear Logic (CSLI Publications, 1991).
49. [49] D. Yetter, Quantales and (noncommutative) linear logic, J. Symbolic Logic 55 (1990) 41-64.