Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algebraic and Logic Programming

International Symposium on Programming Language Implementation and Logic Programming

ALP 1998, PLILP 1998: Principles of Declarative Programming pp 250–265Cite as

Solution to the problem of Zantema on a persistent property of term rewriting systems

  • Conference paper
  • First Online:

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

Abstract

A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P iff its underlying term rewriting system θ(R), which results from R by omitting its sort information, has the property P. It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sort. This is the positive solution to a problem of Zantema, which has been appeared as Rewriting Open Problem 60 in literature.

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. T. Aoto. A proof of the conjecture of Zantema on a persistent property of term rewriting systems. Research Report IS-RR-98-0008F, School of Information Science, JAIST, 1998.

    Google Scholar 

  2. T. Aoto and Y. Toyama. On composable properties of term rewriting systems. In Proceedings of the 6th International Conference on Algebraic and Logic Programming (ALP'97), Southampton, UK, volume 1298 of Lecture Notes in Computer Science, pages 114–128. Springer-Verlag, 1997.

    Google Scholar 

  3. T. Aoto and Y. Toyama. Persistency of confluence. Journal of Universal Computer Science, 3(11):1134–1147, 1997.

    MATH  MathSciNet  Google Scholar 

  4. N. Dershowitz, J.-P. Jouannaud, and J. W. Klop. More problems in rewriting. In Proceedings of the 5th International Conference on Rewriting Techniques and Applications (RTA-93), volume 690 of Lecture Notes in Computer Science, pages 468–487. Springer-Verlag, 1993.

    Google Scholar 

  5. J. R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. de Vries. Comparing curried and uncurried rewriting. Journal of Symbolic Computation, 21:15–39, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Marchiori. On the modularity of normal forms in rewriting. Journal of Symbolic Computation, 22:143–154, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. Middeldorp, H. Ohsaki, and H. Zantema. Transforming termination by self-labelling. In Proceedings of the 13th International Conference on Automated Deduction (CADE-13), volume 1104 of Lecture Notes in Artificial Intelligence, pages 373–387. Springer-Verlag, 1996.

    Google Scholar 

  8. H. Ohsaki. Termination of Term Rewriting Systems: Transformation and Persistence. PhD thesis, University of Tsukuba, March 1998.

    Google Scholar 

  9. H. Ohsaki and A. Middeldorp. Type introduction for equational rewriting. In Proceedings of the 4th International Symposium on Logical Foundations of Computer Science, volume 1234 of Lecture Notes in Computer Science, pages 283–293. Springer-Verlag, 1997.

    Google Scholar 

  10. H. Zantema. Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation, 17:23–50, 1994.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Engineering, Gunma University, Tenjincho 1-5-1, Kiryuu, 376-8515, Gunma, Japan

    Takahito Aoto

Authors
  1. Takahito Aoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Catuscia Palamidessi Hugh Glaser Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aoto, T. (1998). Solution to the problem of Zantema on a persistent property of term rewriting systems. In: Palamidessi, C., Glaser, H., Meinke, K. (eds) Principles of Declarative Programming. ALP PLILP 1998 1998. Lecture Notes in Computer Science, vol 1490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056618

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65012-6

  • Online ISBN: 978-3-540-49766-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation