65 search results - page 3 / 13 » Termination orders for 3-dimensional rewriting |
RTA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
CTRS
1992
13 years 10 months ago
1992
We show that a simple, and easily implementable, restriction on the recursive path ordering, which we call the "binary path condition," sufficesfor establishing terminat...
RTA
2000
Springer
13 years 9 months ago
2000
Springer
WFLP
2009
Springer
14 years 26 days ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
CADE
2001
Springer
13 years 10 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...