Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
ADJ-group: An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types, IBM Res. Rep. RC-6487, 1976
Backus,J.: Can Programming be Liberated from the von Neumann Style?, CACM 21, 1978
Barendregt,H.: The Lambda Calculus, North Holland 1981
Bauer,F.L. & al (the CIP Language Group): Report on a Wide Spectrum Language for Program Specification and Development, Rep. TUM — I8104, TU München 1981
Curien,P.L.: Combinateur Catégoriques, Algorithmes Séquentiels et Programmation Applicative, Thèse d'Etat, Université Paris VII, 1983
Dybjer,P.: Category-Theoretic Logics and Algebras of Programs, PhD, Göteborg 1983
Ehrig,H./Kreowski,H.-J./Thatcher,J./Wagner,E.G./Wright,J.B.: Parameterized Data Types in Algebraic Specification Languages, ICALP'80, LNCS 85, 1980
Ganzinger,H.: Parameterized specifications: Parameter Passing and Implementation, Rep. TUM I8110, TU München 1981, To appear in TOPLAS
Gordon,M.J.C.: The Denotational Description of Programming Languages, Springer 1979
Hupbach,U.L.: Abstract Implementation of Abstract Data Types, MFCS'80, LNCS 88, 1980
Lambeck,J.: From λ-Calculus to Cartesian Closed Categories, In: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Seldin,J.P. & Hindley,J.R. eds., Academic Press 1980
Lawvere,F.W.: Functorial Semantics of Algebraic Theories, Proc. of the National Academy of Sciences 1963
Lipeck,U.: Ein algebraischer Kalkül für einen strukturierten Entwurf von Datenabstraktionen, PhD-thesis, Dortmund 1982
MacLane,S,: Kategorien, Springer 1972
Manes,E.G.: Algebraic Theories, Springer 1974
Martin-Löf,P.: Constructive Mathematics and Computer Programming, 6th Int. Congress for Logic, Methodology and Philosophy of Sciences, Hannover 1979
Milner,R.: A Theory of Type Polymorphism in Programming, JCSS 17, 1979
Mosses,P.: Abstract Semantic Algebras!, In: Proc. IFIP TC-2 Working Conf. on Formal Description of Programming Concepts II, Garmisch-Partenkirchen 1982
Parsaye-Ghomi,K.: Higher Order Abstract Data Types, PhD-thesis, UCLA 1981
Poigné,A.: On Semantic Algebras, Techn. Rep. 156, Abt. Informatik, Univ. Dortmund 1983
Poigné,A.: Higher Order Data Structures — Cartesian Closure Versus λ-Calculus —, Rep. 166, Abt. Informatik, Univ. Dortmund 1983 (Extended version of this paper)
Poigné,A./Voss,J.: Programs over Abstract Data Types — On the Implentation of Abstract Data Types, Techn. Rep. Abt. Informatik, Univ. Dortmund 1983
Scott,D.S.: Relating Theories of the λ-Calculus, In: compare /11/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-12920-0_16
Download citation
DOI: https://doi.org/10.1007/3-540-12920-0_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12920-2
Online ISBN: 978-3-540-38805-0
eBook Packages: Springer Book Archive