Higher order data structures

Cartesian closure versus λ-calculus
  • Axel Poigné
Contibuted Papers

DOI: 10.1007/3-540-12920-0_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 166)
Cite this paper as:
Poigné A. (1984) Higher order data structures. In: Fontet M., Mehlhorn K. (eds) STACS 84. STACS 1984. Lecture Notes in Computer Science, vol 166. Springer, Berlin, Heidelberg


We discuss connections of typed λ-calculus and cartesian closure and prove equivalence of the theories ‘up to abstraction’. This is a working out of ideas of Scott and Lambeck but in an abstract data type environment. The results serve as a basis for the discussion of higher order specifications. We demonstrate that higher order equations based on λ-calculus are more appropriate if the equivalence of λ-calculus and cartesian closure is to be preserved. We construct higher order theories for higher order specifications. For higher order models we discuss existence of initial models and completeness of higher order theories.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1984

Authors and Affiliations

  • Axel Poigné
    • 1
  1. 1.Informatik IIUniversität DortmundDortmund 50Germany

Personalised recommendations