scientific article; zbMATH DE number 3898212
[For the entire collection see Zbl 0561.00021.] Implementations of abstract data types are defined via an enrichment of the target type. We suggest to use an extended typed \(\lambda\)-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.
- On the implementation of abstract data types by programming language constructs
- scientific article; zbMATH DE number 3938540
- scientific article; zbMATH DE number 4074454
- scientific article; zbMATH DE number 3909717
- Algebraic implementation of abstract data types: a survey of concepts and new compositionality results
- On the implementation of abstract data types by programming language constructs
- Computability and implementability issues in abstract data types
- Pebble, a kernel language for modules and abstract data types
- A systematic catalogue of reusable abstract data types
- scientific article; zbMATH DE number 431766 (Why is no real title available?)
- scientific article; zbMATH DE number 3880077 (Why is no real title available?)
- scientific article; zbMATH DE number 3911685 (Why is no real title available?)
- scientific article; zbMATH DE number 3938540 (Why is no real title available?)
- scientific article; zbMATH DE number 3990846 (Why is no real title available?)
- scientific article; zbMATH DE number 4007703 (Why is no real title available?)
- scientific article; zbMATH DE number 4074454 (Why is no real title available?)
- scientific article; zbMATH DE number 33425 (Why is no real title available?)
- scientific article; zbMATH DE number 108387 (Why is no real title available?)
- scientific article; zbMATH DE number 587794 (Why is no real title available?)
- scientific article; zbMATH DE number 3995032 (Why is no real title available?)
- Formal and practical aspects of implementing abstract data types in the prolog instruction
- Paragon: a language using type hierarchies for the specification, implementation and selection of abstract data types
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677152)