Paper Info
Title
Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
Abstract
We classify the computable and semicomputable algebras in terms of finite equational initial algebra specifications and their properties as term term rewriting systems, such as completeness. Further results on properties of these specifications, such as on their size and orthogonality, are provided which show that our main results are the best possible.
Year
DOI
Venue
1995
10.1145/227683.227687
J. ACM
Keywords
DocType
Volume
computable and semicomputable algebras,many sorted algebras,semicomputable algebra,complete term,equational specifications with hidden functions,equational specification
Journal
42
Issue
ISSN
Citations 
6
0004-5411
20
PageRank 
References 
Authors
1.42
9
2
Name
Order
Citations
PageRank
Jan A. Bergstra11445140.42
John V. Tucker260379.06