Computationally equivalent elimination of conditions

Traian Florin Serbanuta; Grigore Roşu

doi:10.1007/11805618_3

Computationally equivalent elimination of conditions

Traian Florin Serbanuta, Grigore Roşu

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

An automatic and easy to implement transformation of conditional term rewrite systems into computationally equivalent unconditional term rewrite systems is presented. No special support is needed from the underlying unconditional rewrite engine. Since unconditional rewriting is more amenable to parallelization, our transformation is expected to lead to efficient concurrent implementations of rewriting.

Original language	English (US)
Title of host publication	Term Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings
Publisher	Springer
Pages	19-34
Number of pages	16
ISBN (Print)	3540368345, 9783540368342
DOIs	https://doi.org/10.1007/11805618_3
State	Published - 2006
Event	17th International Conference on Term Rewriting and Applications, RTA 2006 - Seattle, WA, United States Duration: Aug 12 2006 → Aug 14 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4098 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	17th International Conference on Term Rewriting and Applications, RTA 2006
Country/Territory	United States
City	Seattle, WA
Period	8/12/06 → 8/14/06

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Online availability

10.1007/11805618_3

Library availability

Discover UIUC Full Text

Cite this

Serbanuta, T. F., & Roşu, G. (2006). Computationally equivalent elimination of conditions. In Term Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings (pp. 19-34). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4098 LNCS). Springer. https://doi.org/10.1007/11805618_3

Computationally equivalent elimination of conditions. / Serbanuta, Traian Florin; Roşu, Grigore.
Term Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings. Springer, 2006. p. 19-34 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4098 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Serbanuta, TF & Roşu, G 2006, Computationally equivalent elimination of conditions. in Term Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4098 LNCS, Springer, pp. 19-34, 17th International Conference on Term Rewriting and Applications, RTA 2006, Seattle, WA, United States, 8/12/06. https://doi.org/10.1007/11805618_3

@inproceedings{6affdac40f524eadba28d3ce74dac068,

title = "Computationally equivalent elimination of conditions",

abstract = "An automatic and easy to implement transformation of conditional term rewrite systems into computationally equivalent unconditional term rewrite systems is presented. No special support is needed from the underlying unconditional rewrite engine. Since unconditional rewriting is more amenable to parallelization, our transformation is expected to lead to efficient concurrent implementations of rewriting.",

author = "Serbanuta, {Traian Florin} and Grigore Ro{\c s}u",

year = "2006",

doi = "10.1007/11805618_3",

language = "English (US)",

isbn = "3540368345",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "19--34",

booktitle = "Term Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings",

address = "Germany",

note = "17th International Conference on Term Rewriting and Applications, RTA 2006 ; Conference date: 12-08-2006 Through 14-08-2006",

}

TY - GEN

T1 - Computationally equivalent elimination of conditions

AU - Serbanuta, Traian Florin

AU - Roşu, Grigore

PY - 2006

Y1 - 2006

N2 - An automatic and easy to implement transformation of conditional term rewrite systems into computationally equivalent unconditional term rewrite systems is presented. No special support is needed from the underlying unconditional rewrite engine. Since unconditional rewriting is more amenable to parallelization, our transformation is expected to lead to efficient concurrent implementations of rewriting.

AB - An automatic and easy to implement transformation of conditional term rewrite systems into computationally equivalent unconditional term rewrite systems is presented. No special support is needed from the underlying unconditional rewrite engine. Since unconditional rewriting is more amenable to parallelization, our transformation is expected to lead to efficient concurrent implementations of rewriting.

UR - http://www.scopus.com/inward/record.url?scp=33749402923&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749402923&partnerID=8YFLogxK

U2 - 10.1007/11805618_3

DO - 10.1007/11805618_3

M3 - Conference contribution

AN - SCOPUS:33749402923

SN - 3540368345

SN - 9783540368342

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 19

EP - 34

BT - Term Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings

PB - Springer

T2 - 17th International Conference on Term Rewriting and Applications, RTA 2006

Y2 - 12 August 2006 through 14 August 2006

ER -

Computationally equivalent elimination of conditions

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this