1385 search results - page 4 / 277 » Natural Rewriting for General Term Rewriting Systems |
93
Voted
FLOPS
2010
Springer
14 years 8 months ago
2010
Springer
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
95
Voted
RTA
2005
Springer
15 years 3 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
87
Voted
ALP
1992
Springer
15 years 1 months ago
1992
Springer
The paper presents a new schematization of in nite families of terms called the primal grammars, based on the notion of primitive recursive rewrite systems. This schematization is...
MSCS
2007
14 years 9 months ago
2007
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...