Data types, abstract data types and their specification problem
From MaRDI portal
Publication:1252032
DOI10.1016/0304-3975(79)90059-8zbMath0393.68022OpenAlexW2052771056MaRDI QIDQ1252032
Publication date: 1979
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(79)90059-8
Related Items (6)
A second order theory of data types ⋮ Algebraic specifications of computable and semicomputable data types ⋮ On a conjecture of Bergstra and Tucker ⋮ Final algebras, cosemicomputable algebras and degrees of unsolvability ⋮ Semantics of algorithmic languages ⋮ A constructive method for abstract algebraic software specification
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extended directed graphs, a formalism for structured data and data structures
- The verification and synthesis of data structures
- Data graphs and addressing schemes
- An axiomatic definition of the programming language Pascal
- Data Types as Lattices
- Abstract data types and the development of data structures
- Initial Algebra Semantics and Continuous Algebras
- A relational model of data for large shared data banks
- Heterogeneous algebras
- Toward an understanding of data structures
This page was built for publication: Data types, abstract data types and their specification problem