Algebraic specifications of computable and semicomputable data types

DOI10.1016/0304-3975(87)90123-XzbMath0637.68013MaRDI QIDQ1098613

Jan A. Bergstra, J. V. Tucker

Publication date: 1987

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

zbMATH Keywords

algebraic specification; abstract data types; initial algebra semantics

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

68N01: General topics in the theory of software

Related Items

Coupled map lattices as computational systems, COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS, The meaning of specifications I: Domains and initial models, Meadows and the equational specification of division, Simplifying conditional term rewriting systems: Unification, termination and confluence, On a conjecture of Bergstra and Tucker, Algebraic specifiability of data types with minimal computable parameters, Final algebras, cosemicomputable algebras and degrees of unsolvability, Term-rewriting systems with rule priorities, Which data types have \(\omega\)-complete initial algebra specifications?, On sequential composition, action prefixes and process prefix, A recursive second order initial algebra specification of primitive recursion, A completeness theorem for the expressive power of higher-order algebraic specifications, Randnomness, computability, and algebraic specifications, Specification of real-time and hybrid systems in rewriting logic, Computable total functions on metric algebras, universal algebraic specifications and dynamical systems, On algebraic and logical specifications of classes of regular languages., The data type variety of stack algebras, Piecewise initial algebra semantics, On algebraic specifications of computable algebras with the discriminator technique, A Natural Axiomatization of Computability and Proof of Church's Thesis

Cites Work

• A constructive method for abstract algebraic software specification
• Expressiveness and the completeness of Hoare's logic
• The axiomatic semantics of programs based on Hoare's logic
• Partial evaluation and \(\omega\)-completeness of algebraic specifications
• Final algebra semantics and data type extensions
• Partial abstract types
• Extended directed graphs, a formalism for structured data and data structures
• The algebraic specification of abstract data types
• Data types, abstract data types and their specification problem
• Proof of correctness of data representations
• The completeness of the algebraic specification methods for computable data types
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• Data Type Specification: Parameterization and the Power of Specification Techniques
• CONSTRUCTIVE ALGEBRAS I
• Computable Algebra, General Theory and Theory of Computable Fields
• Numerical analysis as an independent science
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item