142 search results - page 9 / 29 » Total Termination of Term Rewriting |
RTA
2005
Springer
14 years 29 days 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...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under ...
RTA
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
CCL
1994
Springer
13 years 11 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
COLING
1992
13 years 8 months ago
1992
In machine translation (MT) dierent levels of representation can be used to translate a source language sentence onto its target language equivalent. These levels have to be relat...