scientific article; zbMATH DE number 3898212

From MaRDI portal
Publication:3677152





[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.











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)