Preview
Unable to display preview. Download preview PDF.
References
Samson Abramsky. Computational interpretations of linear logic. Technical Report 90/20, Department of Computing, Imperial College, London, October 1990.
Nick Benton, Gavin Bierman, Valeria de Paiva, and Martin Hyland. Term assignment for intuitionistic linear logic. Technical Report 262, Computer Laboratory, University of Cambridge, August 1992.
Nick Benton, Gavin Bierman, Valeria de Paiva, and Martin Hyland. A term calculus for intuitionistic linear logic. In Proceedings of International Conference on Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, March 1993.
Valeria C.V. de Paiva. The Dialetica Categories. PhD thesis, Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, 1988. Published as Computer Laboratory Technical Report 213, 1990.
S. Eilenberg and G.M. Kelly. Closed categories. In Proceedings of Conference on Categorical Algebra, La Jolla, 1966.
T. Fox. Coalgebras and cartesian categories. Communications in Algebra, 4(7):665–667, 1976.
Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–101, 1987.
Jean-Yves Girard, Andre Scedrov, and Philip Scott. Bounded linear logic: A modular approach to polynomial time computability. Theoretical Computer Science, 97:1–66, 1992.
Martin Hyland and Valeria de Paiva. Full intuitionistic linear logic. Unpublished manuscript, 1992.
Bart Jacobs. Semantics of weakening and contraction. Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, unpublished manuscript, May 1992.
G.M. Kelly and S. Mac Lane. Coherence in closed categories. Journal of Pure and Applied Algebra, 1:97–140, 1971.
J. Lambek and P.J. Scott. Introduction to higher order categorical logic, volume 7 of Cambridge studies in advanced mathematics. Cambridge University Press, 1987.
Saunders Mac Lane. Categories for the Working Mathematican, volume 5 of Graduate Texts in Mathematics. Springer-Verlag, 1971.
Patrick Lincoln and John Mitchell. Operational aspects of linear lambda calculus. In Proceedings of Symposium on Logic in Computer Science, pages 235–246, June 1992.
Ian Mackie. Lilac: A functional programming language based on linear logic. Master's thesis, Department of Computing, Imperial College, London, September 1991.
R.A.G. Seely. Linear logic, *-autonomous categories and cofree algebras. In Conference on Categories in Computer Science and Logic, volume 92 of AMS Contemporary Mathematics, pages 371–382, June 1989.
M.E. Szabo, editor. The Collected Papers of Gerhard Gentzen. North-Holland, 1969.
Philip Wadler. There's no substitute for linear logic. Draft Paper, December 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benton, N., Bierman, G., de Paiva, V., Hyland, M. (1993). Linear λ-calculus and categorical models revisited. In: Börger, E., Jäger, G., Kleine Büning, H., Martini, S., Richter, M.M. (eds) Computer Science Logic. CSL 1992. Lecture Notes in Computer Science, vol 702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56992-8_6
Download citation
DOI: https://doi.org/10.1007/3-540-56992-8_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56992-3
Online ISBN: 978-3-540-47890-4
eBook Packages: Springer Book Archive