Skip to main content
SpringerLink
Log in
Book cover

Workshop on the Specification of Abstract Data Types

Workshop of the ESPRIT Basic Research Working Group COMPASS

ADT 1994, COMPASS 1994: Recent Trends in Data Type Specification pp 255–272Cite as

Modular termination of term rewriting systems revisited

  • Contributed Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 906))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Nachum Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17(3):279–301, March 1982.

    Article  Google Scholar 

  2. Nachum Dershowitz. Hierarchical termination. Draft, 1994.

    Google Scholar 

  3. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243–309. North-Holland, 1990.

    Google Scholar 

  4. K. Drosten. Termerssetzungssysteme. PhD thesis, University of Passau, Germany, 1989. In german.

    Google Scholar 

  5. M. Fernandez and J.-P. Jouannaud. Modularity properties of term rewriting systems revisited. Technical Report 875, Laboratoire de Recherche en Informatique, November 1993.

    Google Scholar 

  6. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.

    Google Scholar 

  7. B. Gramlich. A structural analysis of modular termination of term rewriting systems. Research Report SR-91-15, University Kaiserslautern, 1991.

    Google Scholar 

  8. Jean-Pierre Jouannaud and Hélène Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal on Computing, 15(4), November 1986.

    Google Scholar 

  9. Jean-Pierre Jouannaud and Mitsuhiro Okada. Executable higher-order algebraic specification languages. In Proc. 6th IEEE Symp. Logic in Computer Science, Amsterdam, pages 350–361, 1991.

    Google Scholar 

  10. Jean-Pierre Jouannaud and B. Waldmann. Reductive conditional term rewriting systems. In Proc. Third IFIP Working Conference on Formal Description of Programming Concepts, Ebberup, Denmark, 1986.

    Google Scholar 

  11. S. Kamin and Jean-Jacques Lévy. Two generalizations of the recursive path ordering. Available as a report of the department of computer science, University of Illinois at Urbana-Champaign, 1980.

    Google Scholar 

  12. Stephane Kaplan. Conditional rewrite rules. Theoretical Computer Science, 33:175–193, March 1984.

    Article  Google Scholar 

  13. Mahahito Kurihara and Azuma Ohuchi. Non-copying term rewriting and modularity of termination. Hokkaido University.

    Google Scholar 

  14. Mahahito Kurihara and Azuma Ohuchi. Modularity of simple termination of term rewriting systems with shared constructors. Theoretical Computer Science, 103:273–282, 1992.

    Article  Google Scholar 

  15. A. Middeldorp and Y. Toyama. Completeness of combinations of constructor systems. In Proc. 4th Rewriting Techniques and Applications, LNCS 488, Como, Italy, 1991.

    Google Scholar 

  16. Aart Middeldorp. A sufficient condition for the termination of the direct sum of term rewriting systems. In Proc. of the 4th IEEE Symposium on Logic in Computer Science, Pacific Grove, pages 396–401, 1989.

    Google Scholar 

  17. Aart Middeldorp. Modular Properties of Term Rewriting Systems. PhD thesis, Free University of Amsterdam, Netherland, 1990.

    Google Scholar 

  18. Detlef Plump. Implementing term rewriting by graph reduction: Termination of combined systems. In Proc. Conditional and Typed Rewriting Systems, LNCS 516, 1991.

    Google Scholar 

  19. Detlef Plump. Collapsed tree rewriting: Completeness, confluence and modularity. In Proc. Conditional Term Rewriting Systems, LNCS 656, 1993.

    Google Scholar 

  20. M.R.K. Krishna Rao. Modular proofs for completeness of hierarchical systems. to appear, 1993.

    Google Scholar 

  21. M.R.K. Krishna Rao. Modular proofs for simple termination of hierarchical systems. to appear, 1993.

    Google Scholar 

  22. Albert Rubio. Automated deduction with constrained clauses. PhD Thesis, Univ. de Catalunya, 1994.

    Google Scholar 

  23. Michaël Rusinowitch. On termination of the direct sum of term rewriting systems. Information Processing Letters, 26:65–70, 1987.

    Article  Google Scholar 

  24. Y. Toyama. Counterexamples to termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141–143, April 1987.

    Article  Google Scholar 

  25. Y. Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the ACM, 34(1):128–143, April 1987.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Recherche en Informatique, Bât. 490, CNRS et Université de Paris Sud, 91405, Orsay, France

    Maribel Fernández & Jean-Pierre Jouannaud

Authors
  1. Maribel Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Pierre Jouannaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egidio Astesiano Gianna Reggio Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernández, M., Jouannaud, JP. (1995). Modular termination of term rewriting systems revisited. In: Astesiano, E., Reggio, G., Tarlecki, A. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1994 1994. Lecture Notes in Computer Science, vol 906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014432

Download citation

  • DOI: https://doi.org/10.1007/BFb0014432

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59132-0

  • Online ISBN: 978-3-540-49198-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation