Computationally Equivalent Elimination of Conditions

  • Traian Florin Şerbănuţă
  • Grigore Roşu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4098)


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.


Normal Form Structural Term Control Context Reachability Problem Structural Step 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aida, H., Goguen, J.A., Meseguer, J.: Compiling concurrent rewriting onto the rewrite rule machine. In: Okada, M., Kaplan, S. (eds.) CTRS 1990. LNCS, vol. 516, pp. 320–332. Springer, Heidelberg (1991)Google Scholar
  2. 2.
    Antoy, S., Brassel, B., Hanus, M.: Conditional narrowing without conditions. In: PPDP 2003, pp. 20–31. ACM Press, New York (2003)CrossRefGoogle Scholar
  3. 3.
    Bergstra, J.A., Klop, J.W.: Conditional rewrite rules: Confluence and termination. J. of Computer and System Sciences 32(3), 323–362 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Borovansky, P., Cirstea, H., Dubois, H., Kirchner, C., Kirchner, H., Moreau, P., Ringeissen, C., Vittek, M.: ELAN: User Manual, Loria, Nancy, France (2000)Google Scholar
  5. 5.
    Brassel, B.: Bedingte narrowing-verfahren mit verzögerter auswertung. Master’s thesis, RWTH Aachen (1999) (in German)Google Scholar
  6. 6.
    Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: Maude 2.0 Manual (2003),
  7. 7.
    Dershowitz, N., Plaisted, D.A.: Equational programming. In: Hayes, J.E., Michie, D., Richards, J. (eds.) Machine Intelligence 11, pp. 21–56 (1988)Google Scholar
  8. 8.
    Diaconescu, R., Futatsugi, K.: CafeOBJ Report. AMAST Series in Computing, vol. 6. World Scientific, Singapore (1998)zbMATHGoogle Scholar
  9. 9.
    Giovannetti, E., Moiso, C.: Notes on the elimination of conditions. In: Kaplan, S., Jouannaud, J.-P. (eds.) CTRS 1987. LNCS, vol. 308, pp. 91–97. Springer, Heidelberg (1988)Google Scholar
  10. 10.
    Goguen, J., Winkler, T., Meseguer, J., Futatsugi, K., Jouannaud, J.-P.: Introducing OBJ. In: Software Engineering with OBJ, pp. 3–167. Kluwer, Dordrecht (2000)Google Scholar
  11. 11.
    Hanus, M.: The integration of functions into logic programming: From theory to practice. The Journal of Logic Programming 19(20), 583–628 (1994)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Hintermeier, C.: How to transform canonical decreasing CTRSs into equivalent canonical TRSs. In: Lindenstrauss, N., Dershowitz, N. (eds.) CTRS 1994. LNCS, vol. 968, pp. 186–205. Springer, Heidelberg (1995)Google Scholar
  13. 13.
    Lucas, S., Marché, C., Meseguer, J.: Operational termination of conditional term rewriting systems. Inf. Proc. Letters 95(4), 446–453 (2005)zbMATHCrossRefGoogle Scholar
  14. 14.
    Marchiori, M.: Unravelings and ultra-properties. In: Hanus, M., Rodríguez-Artalejo, M. (eds.) ALP 1996. LNCS, vol. 1139, pp. 107–121. Springer, Heidelberg (1996)Google Scholar
  15. 15.
    Marchiori, M.: On deterministic conditional rewriting. Computation Structures Group, Memo 405, MIT Laboratory for Computer Science (1997)Google Scholar
  16. 16.
    Nishida, N., Sakai, M., Sakabe, T.: On simulation-completeness of unraveling for conditional term rewriting systems. In: LA Symposium 2004 Summer, LA Symposium, vol. 2004-7, pp. 1–6 (2004)Google Scholar
  17. 17.
    Ohlebusch, E.: Transforming conditional rewrite systems with extra variables into unconditional systems. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol. 1705, pp. 111–130. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  18. 18.
    Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Heidelberg (2002)zbMATHGoogle Scholar
  19. 19.
    Roşu, G.: From conditional to unconditional rewriting. In: Fiadeiro, J.L., Mosses, P.D., Orejas, F. (eds.) WADT 2004. LNCS, vol. 3423, pp. 218–233. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  20. 20.
    Şerbănuţă, T.F., Roşu, G.: Computationally equivalent elimination of conditions. Technical Report UIUCDCS-R-2006-2693, UIUC (February 2006) Google Scholar
  21. 21.
    van den Brand, M., Heering, J., Klint, P., Olivier, P.A.: Compiling language definitions: the ASF+SDF compiler. ACM TOPLAS 24(4), 334–368 (2002)CrossRefGoogle Scholar
  22. 22.
    Viry, P.: Elimination of conditions. J. of Symb. Comp. 28, 381–401 (1999)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Traian Florin Şerbănuţă
    • 1
  • Grigore Roşu
    • 1
  1. 1.Department of Computer ScienceUniversity of Illinois at Urbana-Champaign 

Personalised recommendations