Computationally Equivalent Elimination of Conditions

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.

[1]  Enno Ohlebusch,et al.  Advanced Topics in Term Rewriting , 2002, Springer New York.

[2]  Massimo Marchiori,et al.  Unravelings and Ultra-properties , 1996, ALP.

[3]  Massimo Marchiori,et al.  On Deterministic Conditional Rewriting , 1997 .

[4]  Nachum Dershowitz,et al.  Conditional and Typed Rewriting Systems , 1994, Lecture Notes in Computer Science.

[5]  Frank Pfenning,et al.  Logic Programming and Automated Reasoning , 1994, Lecture Notes in Computer Science.

[6]  Aart Middeldorp,et al.  Completeness results for basic narrowing , 1994, Applicable Algebra in Engineering, Communication and Computing.

[7]  Martin Wirsing,et al.  Extraction of Structured Programs from Specification Proofs , 1999, WADT.

[8]  Corrado Moiso,et al.  Notes on the Elimination of Conditions , 1987, CTRS.

[9]  Paul Klint,et al.  Compiling language definitions: the ASF+SDF compiler , 2000, TOPL.

[10]  Nishida Naoki,et al.  On Simulation-Completeness of Unraveling for Conditional Term Rewriting Systems , 2004 .

[11]  Nachum Dershowitz,et al.  A Rationale for Conditional Equational Programming , 1990, Theor. Comput. Sci..

[12]  Grigore Rosu,et al.  From Conditional to Unconditional Rewriting , 2004, WADT.

[13]  José Meseguer,et al.  Operational termination of conditional term rewriting systems , 2005, Inf. Process. Lett..

[14]  Michael Hanus,et al.  The Integration of Functions into Logic Programming: From Theory to Practice , 1994, J. Log. Program..

[15]  Nachum Dershowitz,et al.  Canonical Conditional Rewrite Systems , 1988, CADE.

[16]  Nachum Dershowitz,et al.  Equational programming , 1988 .

[17]  José Meseguer,et al.  Compiling Concurrent Rewriting onto the Rewrite Rule Machine , 1990, CTRS.

[18]  Patrick Viry,et al.  Elimination of Conditions , 1995, J. Symb. Comput..

[19]  Razvan Diaconescu,et al.  Cafeobj Report - The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification , 1998, AMAST Series in Computing.

[20]  Jan A. Bergstra,et al.  Conditional Rewrite Rules: Confluence and Termination , 1986, J. Comput. Syst. Sci..

[21]  Joseph A. Goguen,et al.  Software Engineering with OBJ , 2000, Advances in Formal Methods.

[22]  Michael Hanus,et al.  Conditional narrowing without conditions , 2003, PPDP '03.

[23]  Simon Kaplan,et al.  Conditional Term Rewriting Systems , 1987, Lecture Notes in Computer Science.

[24]  Claus Hintermeier,et al.  How to Transform Canonical Decreasing CTRSs into Equivalent Canonical TRSs , 1994, CTRS.

[25]  Pierre Lescanne,et al.  Algebraic and Logic Programming , 1988, Lecture Notes in Computer Science.