53 search results - page 1 / 11 » From Conditional to Unconditional Rewriting |
WADT
2004
Springer
13 years 10 months ago
2004
Springer
An automated technique to translate conditional rewrite rules into unconditional ones is presented, which is suitable to implement, or compile, conditional rewriting on top of much...
WRLA
2010
13 years 2 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
RTA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already give...
RTA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention in the scientific community during the last decades and many differe...
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
We discuss methods for dealing effectively with let-bindings in proofs. Our contribution is a small set of unconditional rewrite rules, found by the bracket abstraction translatio...