论文信息 - Elimination of Conditions

Elimination of Conditions

We present a transformation from any conditional rewrite systems into non conditional ones and prove its correctness. The transformed systems are quite intuitive and well suited for parallel execution. We also show how termination and confluence of the original system are preserved in the transformed one.

Patrick Viry | P. Viry

[1] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

[3] Claude Kirchner,et al. Implementing Parallel Rewriting , 1990, PLILP.

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

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

[6] G Boudol. Computational semantics of term rewriting systems , 1986 .

[7] MeseguerJosé. Conditional rewriting logic as a unified model of concurrency , 1992 .

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

[9] Narciso Martí-Oliet,et al. Rewriting Logic as a Logical and Semantic Framework , 1996 .

[10] Jan A. Bergstra,et al. On Specifying Sets of Integers , 1984, J. Inf. Process. Cybern..

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