Equational specifications, complete term rewriting systems, and computable and semicomputable algebras

DOI10.1145/227683.227687zbMath0885.68092OpenAlexW2165976864MaRDI QIDQ4369896

J. V. Tucker, Jan A. Bergstra

Publication date: 28 January 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://dare.uva.nl/personal/pure/en/publications/equational-specifications-complete-term-rewriting-systems-and-computable-and-semicomputable-algebras(0d3c1456-e37c-4b4b-aed0-2198f4b61106).html

zbMATH Keywords

term rewriting systemsfinite equational initial algebra specificationssemicomputable algebras

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (12)

Fracpairs and fractions over a reduced commutative ring ⋮ The data type variety of stack algebras ⋮ Partial arithmetical data types of rational numbers and their equational specification ⋮ Unnamed Item ⋮ The data type of spatial objects ⋮ Inversive meadows and divisive meadows ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems ⋮ On the axiomatizability of priority. II ⋮ Behavioral abstraction is hiding information ⋮ 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: Equational specifications, complete term rewriting systems, and computable and semicomputable algebras