The data type variety of stack algebras
DOI10.1016/0168-0072(94)00038-5zbMath0821.68082OpenAlexW2117639686WikidataQ127593013 ScholiaQ127593013MaRDI QIDQ1891249
Publication date: 30 May 1995
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://pure.uva.nl/ws/files/4425599/1174_12203y.pdf
term rewriting systemsequational theoryequational specificationcomputable algebrasequational deduction problemminimal algebras in a varietyrecursively enumerable set of equationsstack algebras
Applications of universal algebra in computer science (08A70) Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Applications of computability and recursion theory (03D80) Equational classes, universal algebra in model theory (03C05)
Related Items (3)
Cites Work
- Algebraic specifications of computable and semicomputable data types
- Termination of rewriting
- Algebraic methods: theory, tools and applications. Workshop, held on June 9-11, 1987 in Passau, FRG. Proceedings
- Algebraic system specification and development. A survey and annotated bibliography
- The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III
- The completeness of the algebraic specification methods for computable data types
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
- Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
- Computable Algebra, General Theory and Theory of Computable Fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The data type variety of stack algebras
