Advertisement

On the implementation of abstract data types by programming language constructs

  • Axel Poigné
  • Josef Voss
Colloquium On Trees In Algebra And Programming Semantics And Data Types
Part of the Lecture Notes in Computer Science book series (LNCS, volume 185)

Abstract

Implementations of abstract data types are defined via an enrichment of the target type. We suggest to use an extended typed λ-calculus for such an enrichment in order to meet the conceptual requirement that an implementation has to bring us closer to a (functional) program. Composability of implementations is investigated, the main theorem being that composition of correct implementations is correct if terminating programs are implemented by terminating programs. Moreover we provide syntactical criteria to guarantee correctness of composition.

Keywords

Recursive Scheme Correct Implementation Lambda Calculus Abstract Data Type Recursive Program 
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.

References

  1. [1]
    Barendregt,H.: The Lambda Calculus, North-Holland 1981Google Scholar
  2. [2]
    Burstall,R.M., Goguen,J.A.: Putting Theories Together to Make Specifications, Proc. of 1977 IJCAI MIT Cambridge, 1977Google Scholar
  3. [3]
    Ehrig,H., Kreowski,H.J., Padawitz,P.: Algebraic Implementation of Abstract Data Types. Concept,Syntax,Semantics and Correctness, Proc. ICALP'80, LNCS 85, 1980Google Scholar
  4. [4]
    Ehrig,H., Kreowski,H.J., Mahr,B., Padawitz,P.: Algebraic Implementation of Abstract Data Types, TCS 20, 1982Google Scholar
  5. [5]
    Gandy,R.O.: Proofs of Strong Normalisation, In: To H.B.Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press 1980Google Scholar
  6. [6]
    Ganzinger,H.: Parameterized Specifications: Parameter Passing and Optimizing Implementation, Bericht Nr. TUM-I8110, TU Muenchen 1981Google Scholar
  7. [7]
    Lipeck,U.: Ein algebraischer Kalkuel fuer einen strukturierten Entwurf von Datenabstraktionen, Dissertation, Ber. Nr. 148, Abt. Informatik, Universitaet Dortmund, 1983Google Scholar
  8. [8]
    Poigné,A., Voss,J.: Programs over Algebraic Specifications — On the Implementation of Abstract Data Types, Ber. Nr. 171, Abt. Informatik, Uni Dortmund, 1983Google Scholar
  9. [9]
    Voss,J.: Programme ueber algebraischen Spezifikationen — Zur Implementierung von Abstrakten Datentypen, Diplomarbeit, Abt. Informatik, Uni Dortmund, 1983Google Scholar
  10. [10]
    Blum,E.K., Parisi-Presicce,F.: Implementation of Data Types by Algebraic Methods, JCSS 27, 1983Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Axel Poigné
    • 1
  • Josef Voss
    • 2
  1. 1.Dept. of ComputingImperial CollegeLondon
  2. 2.Abt. InformatikUniversitaet DortmundDortmund 50

Personalised recommendations