TY - JOUR
T1 - From conditional to unconditional rewriting
AU - Roşu, Grigore
PY - 2005
Y1 - 2005
N2 - 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 simpler and easier to optimize unconditional rewrite systems. An experiment performed on world's fastest conditional rewriting engines shows that speedups for conditional rewriting of an order of magnitude can already be obtained by applying the presented technique as a front-end transformation.
AB - 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 simpler and easier to optimize unconditional rewrite systems. An experiment performed on world's fastest conditional rewriting engines shows that speedups for conditional rewriting of an order of magnitude can already be obtained by applying the presented technique as a front-end transformation.
UR - http://www.scopus.com/inward/record.url?scp=24344432100&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=24344432100&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-31959-7_13
DO - 10.1007/978-3-540-31959-7_13
M3 - Conference article
AN - SCOPUS:24344432100
VL - 3423
SP - 218
EP - 233
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SN - 0302-9743
T2 - 17th International Workshop, WADT 2004
Y2 - 27 March 2004 through 29 March 2004
ER -