Skip to main content
Conference ProceedingsOPEN ACCESS

On the implementation of abstract data types by programming language constructs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1985) 185 LNCS 388-402
DOI: 10.1007/3-540-15198-2_25
1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Poigné, A., & Voss, J. (1985). On the implementation of abstract data types by programming language constructs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 185 LNCS, pp. 388–402). Springer Verlag. https://doi.org/10.1007/3-540-15198-2_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free