Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems

DOI10.1137/0212024zbMath0515.68016OpenAlexW1992266201MaRDI QIDQ3662597

J. V. Tucker, Jan A. Bergstra

Publication date: 1983

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/13965

zbMATH Keywords

algebraic specificationscomputableconditional equationsinitial algebra semanticssemicomputable and cosemicomputable algebras

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Partial evaluation and \(\omega\)-completeness of algebraic specifications, A recursive second order initial algebra specification of primitive recursion, 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, Finite-trace linear temporal logic: coinductive completeness, On a conjecture of Bergstra and Tucker, A new approach to abstract data types, I Informal development, Randnomness, computability, and algebraic specifications, Theory of computation over stream algebras, and its applications, Finitely presented expansions of computably enumerable semigroups, 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, 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, Meadows and the equational specification of division, Feferman on Computability, Division safe calculation in totalised fields, A constructive method for abstract algebraic software specification