Categories and Subject Descriptors: D.3.3 [Programming Languages]: Language Constructs and Features; F.1.1 [Computation by Abstract Devices]: Models of Computation; F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages; F.3.3 [Logics and Meanings of Programs]: Studies of Program Constructs; F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic
General Terms: Languages, Theory
Additional Key Words and Phrases: Abstract data types, complete term rewriting systems, computable and semicomputable algebras, equational specifications with hidden functions, many sorted algebras, term rewriting systems
Selected papers that cite this one
- Jan A. Bergstra, Joris A. Hillebrand, and Alban Ponse. Grid protocols based on synchronous communication. Science of Computer Programming, 29(1-2):199-233, July 1997.
- J. A. Bergstra and J. V. Tucker. Initial and final algebra semantics for data type specifications: Two characterization theorems. SIAM Journal on Computing, 12(2):366-387, May 1983.
- J. A. Bergstra and J. V. Tucker. The completeness of the algebraic specification methods for computable data types. Information and Control, 54(3):186-200, September 1982.
- J. A. Bergstra and J. V. Tucker. Algebraic specifications of computable and semicomputable data types. Theoretical Computer Science, 50(2):137-181, 1987. Fundamental study.
- N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1/2):69-115, February/April 1987.
- Lawrence S. Moss, José Meseguer, and Joseph A. Goguen. Final algebras, cosemicomputable algebras and degrees of unsolvability. Theoretical Computer Science, 100(2):267-302, 29 June 1992. Fundamental study.