Abstract
The ordinary untyped λ-calculus (the main object of study in [3]) will be denoted here by λK. Church originally introduced the λI-calculus, which can be understood as the λK-calculus without weakening: one cannot throw away variables. Similarly there is a affine calculus λA without contraction: there, one cannot duplicate variables. There is also a linear calculus λL in which one has neither weakening nor contraction. In λL variables occur precisely once.
We give a systematic description of the semantics of these four calculi. It starts with two sorts of domain theoretic models: graph models and filter models (of intersection types) are constructed for each of these calculi. Later on, we describe an appropriate categorical way to capture such structures in terms of monoidal categories (with diagonals or projections).
The research reported here was done during the academic year '91–'92 at the Pure Maths Dep., Univ. of Cambridge, UK. An early version is [5].
Preview
Unable to display preview. Download preview PDF.
References
S.J. Ambler, ‘First Order Linear Logic in Symmetric Monoidal Closed Categories', PhD. Thesis, Univ. of Edinburgh 1992. Techn. Rep. CST-87-92.
S. van Bakel, ‘Complete restrictions of the intersection type discipline', Theor. Computer Science, vol. 102-2 (1992), pp. 135–163.
H.P. Barendregt, The Lambda Calculus. Its Syntax and Semantics, 2nd rev. ed. (North-Holland, Amsterdam, 1984).
H.P. Barendregt, M. Coppo and M. Dezani-Ciancaglini, ‘A filter lambda model and the completeness of type assignment', Journ. Symbolic Logic 48-4 (1983), pp. 931–940.
B. Jacobs, Notes of a talk held at the 48th PSLL, Edinburgh, 9/10 nov. 1991.
B. Jacobs, 'simply Typed and Untyped Lambda Calculus Revisited', in Applications of Categories in Computer Science edited by M.P. Fourman and P.T. Johnstone and A.M. Pitts, LMS vol. 177 (Cambridge Univ. Press, 1992), pp. 119–142.
B. Jacobs, 'semantics of Weakening and Contraction', manuscript, May 1992.
B. Jacobs, I. Margaria and M. Zacchi, ‘Filter models with polymorphic types', Theor. Computer Science 95-2 (1992), pp. 143–158.
S. MacLane Categories for the Working Mathematician, (Springer, Berlin, 1971).
D.S. Scott, ‘Relating theories of the λ-calculus', in To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism edited by J.R. Hindley and J.P. Seldin (Academic Press, New York and London, 1980), pp. 403–450.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jacobs, B. (1993). Semantics of lambda-I and of other substructure lambda calculi. In: Bezem, M., Groote, J.F. (eds) Typed Lambda Calculi and Applications. TLCA 1993. Lecture Notes in Computer Science, vol 664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037107
Download citation
DOI: https://doi.org/10.1007/BFb0037107
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56517-8
Online ISBN: 978-3-540-47586-6
eBook Packages: Springer Book Archive