Algebraic specifications of computable and semicomputable data types

DOI10.1016/0304-3975(87)90123-XzbMATH Open0637.68013OpenAlexW2007898361MaRDI QIDQ1098613FDOQ1098613

J. A. Bergstra, John V. Tucker

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

abstract data typesalgebraic specificationinitial algebra semantics

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (39)

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

This page was built for publication: Algebraic specifications of computable and semicomputable data types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1098613)