Skip to main content
SpringerLink
Log in
Book cover

LITP Spring School on Theoretical Computer Science

LITP 1985: Combinators and Functional Programming Languages pp 136–175Cite as

Cartesian closed categories and typed λ-calculi

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 242))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Burroni, Algèbres graphiques, 3ième colloque sur les catégories, Cahiers de topologie et géométrie différentielle 23 (1981), 249–265.

    Google Scholar 

  2. P.-L. Curien, Combinateurs catégoriques, algorithmes séquentiels et programmation applicative, Thèse de doctorat d'état, Université Paris VII.

    Google Scholar 

  3. S. Eilenberg and G.M. Kelly, Closed categories, in: Eilenberg, Harrison, MacLane, Röhrl (editors) Proceedings of the conference on categorical algebra, La Jolla 1965 (Springer-Verlag, New York, 1966), 421–562.

    Google Scholar 

  4. K. Gödel, Über eine bisher noch nicht benutzte Erweiterung des finiten Standpunktes, Dialectica 12 (1958), 280–287.

    Google Scholar 

  5. R.L. Goodstein, Recursive number theory (North-Holland Publ. Co., Amsterdam 1957).

    Google Scholar 

  6. J. Lambek, Functional completeness of cartesian categories, Ann. Math. Logic 6 (1974), 259–292.

    Google Scholar 

  7. J. Lambek, From λ-calculus to cartesian closed categories; in J.P. Seldin and J.R. Hindley, To H.B. Curry, Essays in combinatory logic, lambda calculus and formalism (Academic Press, London 1980), 375–402.

    Google Scholar 

  8. J. Lambek and P.J. Scott, Aspects of higher order categorical logic, Contemporary mathematics 30 (1984), 145–174.

    Google Scholar 

  9. J. Lambek and P.J. Scott, Introduction to higher order categorical logic (Cambridge University Press, 1985).

    Google Scholar 

  10. L.E. Sanchis, Functionals defined by recursion, Notre Dame Journal of Formal Logic 8 (1967) 161–174.

    Google Scholar 

  11. M.-F. Thibault, Prerecursive categories, J. Pure and Applied Algebra 24 (1982) 79–93.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. McGill University, Canada

    J. Lambek

Authors
  1. J. Lambek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Guy Cousineau Pierre-Louis Curien Bernard Robinet

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lambek, J. (1986). Cartesian closed categories and typed λ-calculi. In: Cousineau, G., Curien, PL., Robinet, B. (eds) Combinators and Functional Programming Languages. LITP 1985. Lecture Notes in Computer Science, vol 242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17184-3_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-17184-3_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17184-3

  • Online ISBN: 978-3-540-47253-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation