Advertisement

Semantics of lambda-I and of other substructure lambda calculi

  • Bart Jacobs
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 664)

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).

Keywords

Natural Transformation Complete Lattice Monoidal Category Neutral Element Filter Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S.J. Ambler, ‘First Order Linear Logic in Symmetric Monoidal Closed Categories', PhD. Thesis, Univ. of Edinburgh 1992. Techn. Rep. CST-87-92.Google Scholar
  2. [2]
    S. van Bakel, ‘Complete restrictions of the intersection type discipline', Theor. Computer Science, vol. 102-2 (1992), pp. 135–163.Google Scholar
  3. [3]
    H.P. Barendregt, The Lambda Calculus. Its Syntax and Semantics, 2nd rev. ed. (North-Holland, Amsterdam, 1984).Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    B. Jacobs, Notes of a talk held at the 48th PSLL, Edinburgh, 9/10 nov. 1991.Google Scholar
  6. [6]
    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.Google Scholar
  7. [7]
    B. Jacobs, 'semantics of Weakening and Contraction', manuscript, May 1992.Google Scholar
  8. [8]
    B. Jacobs, I. Margaria and M. Zacchi, ‘Filter models with polymorphic types', Theor. Computer Science 95-2 (1992), pp. 143–158.Google Scholar
  9. [9]
    S. MacLane Categories for the Working Mathematician, (Springer, Berlin, 1971).Google Scholar
  10. [10]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Bart Jacobs
    • 1
  1. 1.Mathematical Institute RUUTA UtrechtNL

Personalised recommendations