Completeness of Proof Systems for Equational Specifications

DOI10.1109/TSE.1985.232484zbMath0558.68017OpenAlexW1998691016MaRDI QIDQ3347269

Donald Sannella, David B. MacQueen

Publication date: 1985

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tse.1985.232484

zbMATH Keywords

equational logicdata constraintsequational data type specifications

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (7)

Structured theory presentations and logic representations ⋮ Structured algebraic specifications: A kernel language ⋮ Specifications in an arbitrary institution ⋮ Proving and rewriting ⋮ Higher-order order-sorted algebras ⋮ Soundness and completeness of the Birkhoff equational calculus for many-sorted algebras with possibly empty carrier sets ⋮ Which data types have \(\omega\)-complete initial algebra specifications?

This page was built for publication: Completeness of Proof Systems for Equational Specifications