About the implementability and the power of equationally defined data abstractions

DOI10.1016/0304-3975(81)90048-7zbMath0472.68011OpenAlexW2004721915MaRDI QIDQ1157900

S. H. Smith

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90048-7

zbMATH Keywords

computability theoryexpressive powerimplementabilitycongruence semanticsequationally defined data algebraimplementable algebra

Mathematics Subject Classification ID

Data structures (68P05) Algebraic structures (08A99)

Cites Work

• Unnamed Item
• Unnamed Item
• Extended directed graphs, a formalism for structured data and data structures
• The algebraic specification of abstract data types
• An Introduction to the Construction and Verification of Alphard Programs
• Abstract data types and software validation
• Data type specification

This page was built for publication: About the implementability and the power of equationally defined data abstractions