Computationally equivalent elimination of conditions

Traian Florin Serbanuta, Grigore Roşu

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationTerm Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings
PublisherSpringer-Verlag Berlin Heidelberg
Pages19-34
Number of pages16
ISBN (Print)3540368345, 9783540368342
DOIs
StatePublished - 2006
Event17th International Conference on Term Rewriting and Applications, RTA 2006 - Seattle, WA, United States
Duration: Aug 12 2006Aug 14 2006

Publication series

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

Other

Other17th International Conference on Term Rewriting and Applications, RTA 2006
CountryUnited States
CitySeattle, WA
Period8/12/068/14/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Computationally equivalent elimination of conditions'. Together they form a unique fingerprint.

Cite this