Final Data Types and Their Specification

DOI10.1145/357195.357202zbMath0498.68008OpenAlexW1989177109MaRDI QIDQ3964001

Samuel Kamin

Publication date: 1983

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/357195.357202

zbMATH Keywords

testingdebuggingdata abstractionspecification techniques

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (14)

Structured algebraic specifications: A kernel language ⋮ Generalization of final algebra semantics by relativization ⋮ Behavioural approaches to algebraic specifications. A comparative study ⋮ On observational equivalence and algebraic specification ⋮ Toward formal development of programs from algebraic specifications: Implementations revisited ⋮ Proof by consistency ⋮ Specifications in an arbitrary institution ⋮ Mongruences and cofree coalgebras ⋮ Functional un\(|\)unparsing ⋮ Context induction: A proof principle for behavioural abstractions and algebraic implementations ⋮ Observational specifications and the indistinguishability assumption ⋮ From Grammars and Automata to Algebras and Coalgebras ⋮ Modal logic and algebraic specifications ⋮ A constructive method for abstract algebraic software specification

This page was built for publication: Final Data Types and Their Specification