scientific article; zbMATH DE number 3703962

MaRDI QIDQ3896478zbMATH OpenFDO

Authors J. A. Bergstra, John V. Tucker

Publication date 1980

zbMATH Keywords

computable data typeequational specificationinitial algebra semantics

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Applications of computability and recursion theory (03D80) Theory of operating systems (68N25) Data structures (68P05)

Cited in

(32)

• Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms
• Algebraic specifications of computable and semicomputable data types
• Conditional rewrite rules: Confluence and termination
• Algebras with finitely approximable positively representable enrichments
• Conditional rewriting logic as a unified model of concurrency
• Contextual rewriting as a sound and complete proof method for conditional LOG-specifications
• Enumerated algebras with uniformly recursive-separable classes
• Maude: specification and programming in rewriting logic
• The data type variety of stack algebras
• Twenty years of rewriting logic
• Specification and proof in membership equational logic
• Computably separable models
• Generalized rewrite theories, coherence completion, and symbolic methods
• Programming and symbolic computation in Maude
• Positive algebras with countable congruence lattices
• Soundness in verification of algebraic specifications with OBJ
• Uniformly computably separable algebras with effectively splittable families of negative congruences
• What Is a Multi-modeling Language?
• scientific article; zbMATH DE number 1231543 (Why is no real title available?)
• scientific article; zbMATH DE number 1231654 (Why is no real title available?)
• Theory of computation over stream algebras, and its applications
• Preservation in many-valued truth institutions
• Towards automated deduction in cP systems
• Lower semilattices of separable congruences of numbered algebras
• Separable algorithmic representations of classical systems and their applications
• Building correct-by-construction systems with formal patterns
• Unoids with finiteness conditions over computably separable equivalences
• Defining algorithmically presented structures in first order logic
• Inductive reasoning with equality predicates, contextual rewriting and variant-based simplification
• Semantics of algorithmic languages
• Algebraic simulations
• Equational abstractions

This page was built for publication:

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