The completeness of the algebraic specification methods for computable data types

DOI10.1016/S0019-9958(82)80021-1zbMath0513.68017MaRDI QIDQ3659115

J. V. Tucker, Jan A. Bergstra

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

equational specificationalgebra semantics

Mathematics Subject Classification ID

Data structures (68P05) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (13)

The data type variety of stack algebras ⋮ Algebraic specifications of computable and semicomputable data types ⋮ A completeness theorem for the expressive power of higher-order algebraic specifications ⋮ Partial arithmetical data types of rational numbers and their equational specification ⋮ On a conjecture of Bergstra and Tucker ⋮ Randnomness, computability, and algebraic specifications ⋮ Algebraic specifiability of data types with minimal computable parameters ⋮ The wheel of rational numbers as an abstract data type ⋮ Higher-order equational logic for specification, simulation and testing ⋮ On algebraic specifications of computable algebras with the discriminator technique ⋮ Meadows and the equational specification of division ⋮ Division safe calculation in totalised fields ⋮ Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms

This page was built for publication: The completeness of the algebraic specification methods for computable data types