Keywords
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
P.-L. Curien, Combinateurs catégoriques, algorithmes séquentiels et programmation applicative, Thèse de doctorat d'état, Université Paris VII.
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.
K. Gödel, Über eine bisher noch nicht benutzte Erweiterung des finiten Standpunktes, Dialectica 12 (1958), 280–287.
R.L. Goodstein, Recursive number theory (North-Holland Publ. Co., Amsterdam 1957).
J. Lambek, Functional completeness of cartesian categories, Ann. Math. Logic 6 (1974), 259–292.
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.
J. Lambek and P.J. Scott, Aspects of higher order categorical logic, Contemporary mathematics 30 (1984), 145–174.
J. Lambek and P.J. Scott, Introduction to higher order categorical logic (Cambridge University Press, 1985).
L.E. Sanchis, Functionals defined by recursion, Notre Dame Journal of Formal Logic 8 (1967) 161–174.
M.-F. Thibault, Prerecursive categories, J. Pure and Applied Algebra 24 (1982) 79–93.
Author information
Authors and Affiliations
Editor information
Rights 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