From conditional to unconditional rewriting

Research output: Contribution to journalConference article

Abstract

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.

Original languageEnglish (US)
Pages (from-to)218-233
Number of pages16
JournalLecture Notes in Computer Science
Volume3423
StatePublished - Sep 14 2005
Event17th International Workshop, WADT 2004 - Barcelona, Spain
Duration: Mar 27 2004Mar 29 2004

Fingerprint

Rewriting
Engines
Experiments
Engine
Optimise
Experiment

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

From conditional to unconditional rewriting. / Roşu, Grigore.

In: Lecture Notes in Computer Science, Vol. 3423, 14.09.2005, p. 218-233.

Research output: Contribution to journalConference article

@article{f846a56889734e2d8b19fc7c400697b5,
title = "From conditional to unconditional rewriting",
abstract = "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.",
author = "Grigore Roşu",
year = "2005",
month = "9",
day = "14",
language = "English (US)",
volume = "3423",
pages = "218--233",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - From conditional to unconditional rewriting

AU - Roşu, Grigore

PY - 2005/9/14

Y1 - 2005/9/14

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

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

ER -