Skip to main content
SpringerLink
Log in

Transformations of Conditional Rewrite Systems Revisited

  • Conference paper
Book cover Recent Trends in Algebraic Development Techniques (WADT 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5486))

Included in the following conference series:

Abstract

We revisit known transformations of conditional rewrite systems to unconditional ones in a systematic way. We present a unified framework for describing, analyzing and classifying such transformations, discuss the major problems arising, and finally present a new transformation which has some advantages as compared to the approach of [6]. The key feature of our new approach (for left-linear confluent normal 1-CTRSs) is that it is backtracking-free due to an appropriate encoding of the conditions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aida, H., Goguen, J., 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)

    Chapter  Google Scholar 

  2. Antoy, S., Brassel, B., Hanus, M.: Conditional narrowing without conditions. In: Proc. PPDP (2003), August 27-29, pp. 20–31. ACM Press, New York (2003)

    Google Scholar 

  3. Baader, F., Nipkow, T.: Term rewriting and All That. Cambridge University Press, Cambridge (1998)

    Book  MATH  Google Scholar 

  4. Bergstra, J., Klop, J.: Conditional rewrite rules: Confluence and termination. Journal of Computer and System Sciences 32(3), 323–362 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  5. Braßel, B.: Bedingte Narrowing-Verfahren mit verzögerter Auswertung. Master’s thesis, RWTH Aachen (1999)

    Google Scholar 

  6. Şerbănuţă, T.-F., Roşu, G.: Computationally equivalent elimination of conditions. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 19–34. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Dershowitz, N., Okada, M., Sivakumar, G.: Confluence of conditional rewrite systems. In: Kaplan, S., Jouannaud, J.-P. (eds.) CTRS 1987. LNCS, vol. 308, pp. 31–44. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  8. Dershowitz, N., Plaisted, D.: Equational programming. In: Hayes, J.E., Michie, D., Richards, J. (eds.) Machine Intelligence 11: The logic and acquisition of knowledge ch. 2, pp. 21–56 (1988)

    Google Scholar 

  9. Giovanetti, 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)

    Chapter  Google Scholar 

  10. Lucas, S., Meseguer, J., Marché, C., Urbain, X.: Proving operational termination of membership equational programs. Higher-Order and Symbolic Computation 21(10), 59–88 (2008)

    MATH  Google Scholar 

  11. Marchiori, M.: Unravelings and ultra-properties. Technical Report 8, University of Padova, Italy (1995)

    Google Scholar 

  12. 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)

    Chapter  Google Scholar 

  13. Nishida, N., Mizutani, T., Sakai, M.: Transformation for refining unraveled conditional term rewriting systems. ENTCS, vol. 174(10), pp. 75–95 (2007)

    Google Scholar 

  14. Nishida, N., Sakai, M., Sakabe, T.: Partial inversion of constructor term rewriting systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 264–278. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  16. Rosu, 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)

    Chapter  Google Scholar 

  17. Schernhammer, F., Gramlich, B.: On proving and characterizing operational termination of deterministic conditional rewrite systems. In: Hofbauer, D., Serebrenik, A. (eds.) Proc. WST (2007), pp. 82–85 (2007)

    Google Scholar 

  18. Viry, P.: Elimination of conditions. J. Symb. Comput. 28(3), 381–401 (1999)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. TU Wien, Austria

    Karl Gmeiner & Bernhard Gramlich

Authors
  1. Karl Gmeiner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernhard Gramlich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Largo Bruno Pontecorvo 3, 56127, Pisa, Italy

    Andrea Corradini  & Ugo Montanari  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gmeiner, K., Gramlich, B. (2009). Transformations of Conditional Rewrite Systems Revisited. In: Corradini, A., Montanari, U. (eds) Recent Trends in Algebraic Development Techniques. WADT 2008. Lecture Notes in Computer Science, vol 5486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03429-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03429-9_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03428-2

  • Online ISBN: 978-3-642-03429-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation