A mixed linear and non-linear logic: Proofs, terms and models: Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 933, Issue , 1995, Pages 121-135

  Benton, P N ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; LINEAR ALGEBRA;

CARTESIAN CLOSED CATEGORY; CATEGORICAL MODEL; EXTENDED ABSTRACTS; INTUITIONISTIC LINEAR LOGIC; INTUITIONISTIC LOGIC; NATURAL DEDUCTION; SEQUENT CALCULUS; SYMMETRIC MONOIDAL CLOSED CATEGORIES;

COMPUTER CIRCUITS;

EID: 84955583235     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0022251     Document Type: Conference Paper

References (15)

1. E. Barendsen and S. Smetsers. Conventional and uniqueness typing in graph re'write systems. Technical Report CSI-R9328, Katholieke Universiteit Nijmegen, December 1993.
2. P. N. Benton. A mixed linear and non-linear logic: Proofs, terms and models (preliminary report). Technical Report 352, Computer Laboratory, University of Cambridge, September 1994.
3. P. N. Benton. Strong normalisation for the linear term calculus. Journal of Functional Programming, 1995. To appear. Also available as Technical Report 305, University of Cambridge Computer Laboratory, July 1993.
4. P. N. Benton, G. M. Bierman, J. M. E. Hyland, and V. C. V. de Paiva. Linear lambda calculus and categorical models revisited. In E. Börger et al., editor, Selected Papers from Computer Science Logic '92, volume 702 of Lecture Notes in Computer Science. Springer-Verlag, 1993.
5. P. N. Benton, G. M. Bierman, J. M. E. Hyland, and V. C. V. de Paiva. A term calculus for intuitionistic linear logic. In M. Bezem and J. F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science. Springer-Verlag, 1993.
6. G. M. Bierman. On intuitionistic linear logic (revised version of PhD thesis). Technical Report 346, Computer Laboratory, University of Cambridge, August 1994.
7. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102,1987.
8. J.-Y. Girard. On the unity of logic. Annals of Pure and Applied Logic, 59:201-217,1993.
9. B. Jacobs. Conventional and linear types in a logic of coalgebras. Preprint, University of Utrecht, April 1993.
10. P. Lincoln and J. C. Mitchell. Operational aspects of linear lambda calculus. In Proceedings of the 7th Annual Symposium on Logic in Computer Science. IEEE, 1992.
11. E. Moggi. Notions of computation and monads. Information and Computation, 93:55-92, 1991.
12. G. D. Plotkin. Type theory and recursion (abstract). In Proceedings of 8th Conference on Logic in Computer Science. IEEE Computer Society Press, 1993.
13. R. A. G. Seely. Linear logic, autonomous categories and cofree coalgebras. In Conference on Categories in Computer Science and Logic, volume 92 of AMS Contemporary Mathematics, June 1980.
14. P. Wadler. There's no substitute for linear logic (projector slides). In G. Winskel, editor, Proceedings of the CLICS Workshop (Part I), March 1992, Aarhus, Denmark, May 1992. Available as DAIMI PB-397-I Computer Science Department, Aarhus University.
15. P. Wadler. A taste of linear logic. In A. M. Borzyszkowski and S. Sokolowski, editors, Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, number 711 in Lecture Notes in Computer Science, pages 185-210, 1993.