3 search results - page 1 / 1 » Term Rewriting Systems: From Church-Rosser to Knuth-Bendix a... |
ICALP
1990
Springer
13 years 9 months ago
1990
Springer
Termrewritingsystemsare importantfor computabilitytheoryof abstractdata types,for automatictheorem proving, and for the foundationsof functionalprogramming.In this shortsurveywe pr...
IJSI
2008
13 years 5 months ago
2008
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
CTRS
1987
13 years 9 months ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...