Approximation properties of abstract data types
From MaRDI portal
Publication:1838281
DOI10.1016/0304-3975(83)90131-7zbMath0509.68016OpenAlexW2044306290MaRDI QIDQ1838281
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90131-7
congruence relationfixed point propertiesChurch-Rosser (confluence) propertydata type languageequational abstract data type specificationspartially ordered quotient algebra modelWadsworth's approximation property
Cites Work
- Final algebra semantics and data type extensions
- Computing in systems described by equations
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- The algebraic specification of abstract data types
- IO and OI. II
- On coverings of universal algebras
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Initial Algebra Semantics and Continuous Algebras
- Abstract data types and software validation
- Approximate Reduction and Lambda Calculus Models
- Heterogeneous algebras
- Tree-Manipulating Systems and Church-Rosser Theorems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximation properties of abstract data types