Skip to main content
SpringerLink
Log in

Cartesian closure — Higher types in categories

  • Part I Tutorials
  • Chapter
  • First Online:
Category Theory and Computer Programming

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

  • 2650 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.A. Arbib, E.G. Manes, Arrows, Structures and Functors — The Categorical Imperative, Academic Press, New York-San Francisco-London 1975

    Google Scholar 

  2. H.Barendregt, The Lambda Calculus, North Holland 1984

    Google Scholar 

  3. G.Berry, Some Syntactic and Categorical Constructions of Lambda-Calculus Models, Rapport INRIA 80, 1981

    Google Scholar 

  4. P.-L. Curien, Categorical Combinators, Sequential Algorithms and Functional Programming, Pitman, London 1981

    Google Scholar 

  5. S.Eilenberg, G.M.Kelly, Closed Categories, Proc. Conf. on Categorical Algebra at La Jolla, Springer Verlag 1966

    Google Scholar 

  6. M.C.B.Hennessy, The Semantics of Call-by-value and Call-by-name in a Non-deterministic Environment, SIAM J. Comp. 1980

    Google Scholar 

  7. J.Lambek, From Lambda Calculus to Cartesian Closed Categories, In To H.B.Curry: Essays on Combinatiry Logic, Lambda-Calculus and Formalism, ed. J.P.Seldin and J.R.Hindley, Academic Press 1980

    Google Scholar 

  8. J.Lambek, P.Scott, Introduction to Higher Order Categorical Logic, Cambridge University Press 86

    Google Scholar 

  9. S.MacLane, Categories for the Working Mathematician, Springer Graduate Texts in Mathematics 1971

    Google Scholar 

  10. F.W.Lawvere, Functorial Semantics of Algebraic Theories, Dissertation, Columbia University, 1963

    Google Scholar 

  11. E.Moggi, Categories of Partial Morphisms & the λp-Calculus, this volume

    Google Scholar 

  12. M.Pfender, Universal Algebra in S-Monoidal Categories, Algebra Berichte Nr. 20, Universität München 1974

    Google Scholar 

  13. A.Poigné, On the Construction of Free Algebras in S-Monoidal Categories, Dissertation, Dortmund 1979 (in German)

    Google Scholar 

  14. A.Poigné, On Specifications, Theories, and Models with Higher Types, Information & Control 86

    Google Scholar 

  15. D.S.Scott, Identity and Existence in Intutionistic Logic, In M.P.Fourman, C.J.Mulvey, D.S.Scott (eds.) Applications of Sheaves, LNiMath 753, 1977

    Google Scholar 

  16. D.S.Scott, Relating Theories of Lambda Calculus, In To H.B.Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, ed. J.P.Seldin and J.R.Hindley, Academic Press 1980

    Google Scholar 

Download references

Authors
  1. Axel Poigné
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David Pitt Samson Abramsky Axel Poigné David Rydeheard

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Poigné, A. (1986). Cartesian closure — Higher types in categories. In: Pitt, D., Abramsky, S., Poigné, A., Rydeheard, D. (eds) Category Theory and Computer Programming. Lecture Notes in Computer Science, vol 240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17162-2_117

Download citation

  • DOI: https://doi.org/10.1007/3-540-17162-2_117

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17162-1

  • Online ISBN: 978-3-540-47213-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation