Computationally Equivalent Elimination of Conditions

Serbanuta, Traian Florin; Rosu, Grigore

Permalink

https://hdl.handle.net/2142/11166 Copy

Description

Title

Computationally Equivalent Elimination of Conditions

Author(s)

• Serbanuta, Traian Florin
• Rosu, Grigore

Issue Date

2006-02

Keyword(s)

computer science

Date of Ingest

2009-04-20T19:46:47Z

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.

Type of Resource

text

Genre of Resource

Technical Report

Permalink

http://hdl.handle.net/2142/11166

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections