Algebraic specifications of computable and semicomputable data types

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

J. V. Tucker, Jan A. Bergstra

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90123-x

zbMATH Keywords

algebraic specificationabstract data typesinitial algebra semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items

On algebraic and logical specifications of classes of regular languages., Coupled map lattices as computational systems, On sequential composition, action prefixes and process prefix, A recursive second order initial algebra specification of primitive recursion, The data type variety of stack algebras, Simplifying conditional term rewriting systems: Unification, termination and confluence, A completeness theorem for the expressive power of higher-order algebraic specifications, COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS, Specifying with syntactic theory functors, On a conjecture of Bergstra and Tucker, Randnomness, computability, and algebraic specifications, Unnamed Item, Theory of computation over stream algebras, and its applications, Finitely presented expansions of computably enumerable semigroups, A step towards absolute versions of metamathematical results, The data type of spatial objects, Inversive meadows and divisive meadows, Degrees of Word Problem for Algebras Without Finitely Presented Expansions, Computability theory. Abstracts from the workshop held January 7--13, 2018, Algebraic specifiability of data types with minimal computable parameters, Piecewise initial algebra semantics, The meaning of specifications I: Domains and initial models, The wheel of rational numbers as an abstract data type, Finitely presented expansions of groups, semigroups, and algebras, Higher-order equational logic for specification, simulation and testing, Final algebras, cosemicomputable algebras and degrees of unsolvability, Computable total functions on metric algebras, universal algebraic specifications and dynamical systems, On algebraic specifications of computable algebras with the discriminator technique, A Natural Axiomatization of Computability and Proof of Church's Thesis, Meadows and the equational specification of division, Term-rewriting systems with rule priorities, Division safe calculation in totalised fields, Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms, Which data types have \(\omega\)-complete initial algebra specifications?, Specification of real-time and hybrid systems in rewriting logic

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