scientific article
From MaRDI portal
Publication:3853107
zbMath0419.68029MaRDI QIDQ3853107
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algebraic specificationabstract data structureshidden functionscomputable and semicomputable algebrashidden sorts
Data structures (68P05) Applications of computability and recursion theory (03D80) Theory of numerations, effectively presented structures (03D45)
Related Items
Recursive unary algebras and trees, Partial evaluation and \(\omega\)-completeness of algebraic specifications, The data type variety of stack algebras, Crypt-equivalent algebraic specifications, Algebraic specifications of computable and semicomputable data types, Algebras with finitely approximable positively representable enrichments, On a conjecture of Bergstra and Tucker, Unnamed Item, A simple transfer lemma for algebraic specifications, On algebraic specifications of computable algebras with the discriminator technique, Characterizing specification languages which admit initial semantics
