3 search results - page 1 / 1 » Rewrite Closure for Ground and Cancellative AC Theories |
FSTTCS
2001
Springer
13 years 9 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
ENTCS
2002
13 years 4 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
WRLA
2010
13 years 3 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...