498 search results - page 19 / 100 » Term Rewriting |
90
Voted
PPDP
2004
Springer
15 years 3 months ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
AMAST
2010
Springer
14 years 4 months ago
2010
Springer
mu-term is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost ...
80
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, , ) such that L and R are termgraphs representing...
120
click to vote
FROCOS
2011
Springer
13 years 9 months ago
2011
Springer
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
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 λ-calcul...