1458 search results - page 24 / 292 » Extended Term Rewriting Systems |
103
Voted
LISP
2006
15 years 13 days ago
2006
The last few years have seen the development of the rewriting calculus (also called rho-calculus or -calculus) that uniformly integrates first-order term rewriting and the -calculu...
101
click to vote
RTA
2009
Springer
15 years 7 months ago
2009
Springer
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
101
Voted
RTA
2010
Springer
15 years 4 months ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
125
Voted
CADE
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
101
click to vote
ENTCS
2002
15 years 9 days ago
2002
Two co-initial reductions in a term rewriting system are said to be equivalent if they perform the same steps, albeit maybe in a different order. We present four characterisations...