Advertisement

Functorial semantics of the type free λ-βη calculus

  • Adam Obtułowicz
Section B Computation Theory in Category
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BH]
    -Barendregt H.P.: Some Extensional Term Models for Combinatory logic and λ-calculi, Ph.D.dissertation, Univ.Utrecht 1971.Google Scholar
  2. [HLS]
    -Hindley J.R., Lercher B., Seldin J.P.: Introduction to Combinatory Logic, Cambridge University Press 1972.Google Scholar
  3. [LJ]
    -Lambek J.: Functional Completeness of Cartesian Categories, Annals of Mathematical Logic 6 (1974) pp. 259–292.Google Scholar
  4. [LW]
    -Lawvere F.W.: Introduction to Part I, in Model Theory and Topoi, Lecture Notes in Mathematics Vol. 445 pp.3–14, Springer Verlag 1975.Google Scholar
  5. [RJ]
    -Reynolds J.C.: Notes on a Lattice-theoretic Approach to the Theory of Computation, Syracuse University 1972.Google Scholar
  6. [SD]
    -Scott D.: Continuous Lattices, in Toposes Algebraic Geometry and Logic, Lecture Notes in Mathematics Vol. 274 pp. 97–136. Springer Verlag 1972.Google Scholar
  7. [SH]
    -Schubert H.: Categories, Springer Verlag 1972.Google Scholar
  8. [WCP]
    -Wadsworth C.P.: The relation between Lambda-expressions and their denotations, the seminar talk at IRIA, Paris in January 1973.Google Scholar
  9. [VH]
    -Volger H.: Completeness theorem for logical categories, in Model Theory and Topoi, Lecture Notes in Mathematics Vol.445 pp.51–86, Springer Verlag 1975.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Adam Obtułowicz
    • 1
  1. 1.Instytut MatematykiPolitechnika WarszawskaWarszawaPoland

Personalised recommendations