289 search results - page 6 / 58 » Program transformation by templates based on term rewriting |
JAR
2006
13 years 7 months ago
2006
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
BIRTHDAY
2005
Springer
14 years 27 days 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 ...
BIRTHDAY
2007
Springer
14 years 1 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
LISP
2006
13 years 7 months ago
2006
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present a new approach based on the igher-order abstract syntax and ...
ENTCS
2007
13 years 7 months ago
2007
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...