Approximation properties of abstract data types
From MaRDI portal
Cites work
- Abstract data types and software validation
- An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
- Approximate Reduction and Lambda Calculus Models
- Computing in systems described by equations
- Final algebra semantics and data type extensions
- Heterogeneous algebras
- scientific article; zbMATH DE number 3714891 (Why is no real title available?)
- scientific article; zbMATH DE number 3735102 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 3619855 (Why is no real title available?)
- scientific article; zbMATH DE number 3439971 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3227055 (Why is no real title available?)
- Initial Algebra Semantics and Continuous Algebras
- IO and OI. II
- On coverings of universal algebras
- The algebraic specification of abstract data types
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Tree-Manipulating Systems and Church-Rosser Theorems
This page was built for publication: Approximation properties of abstract data types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838281)