Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
- 1 November 1995
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 42 (6) , 1194-1230
- https://doi.org/10.1145/227683.227687
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Final algebras, cosemicomputable algebras and degrees of unsolvabilityTheoretical Computer Science, 1992
- Universal Algebra for Computer ScientistsPublished by Springer Nature ,1992
- Termination of rewritingJournal of Symbolic Computation, 1987
- Algebraic specifications of computable and semicomputable data typesTheoretical Computer Science, 1987
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization TheoremsSIAM Journal on Computing, 1983
- The completeness of the algebraic specification methods for computable data typesInformation and Control, 1982
- ComputabilityPublished by Cambridge University Press (CUP) ,1980
- Some definitions for algebraic data type specificationsACM SIGPLAN Notices, 1979
- Theorie Der Numerierungen IIIMathematical Logic Quarterly, 1977