On the implementation of abstract data types by programming language constructs

DOI10.1016/0022-0000(87)90029-8zbMath0619.68025OpenAlexW2166482687MaRDI QIDQ1089793

Axel Poigné, Josef Voss

Publication date: 1987

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(87)90029-8

zbMATH Keywords

correctnesstyped \(\lambda \)-calculus

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Some lambda calculi with categorical sums and products, Combining algebraic rewriting, extensional lambda calculi, and fixpoints, Simulating expansions without expansions, A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object, A confluent reduction for the λ-calculus with surjective pairing and terminal object

Cites Work

• Implementation of data types by algebraic methods
• Parameter passing in algebraic specification languages
• Generalized algebraic theories and contextual categories
• Algebraic implementation of abstract data types
• Abstract data types and algebraic semantics of programming languages
• Combinators, \(\lambda\)-terms and proof theory
• The Expressiveness of Simple and Second-Order Type Structures
• On specifications, theories, and models with higher types
• Initial Algebra Semantics and Continuous Algebras
• Intensional interpretations of functionals of finite type I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item