Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rewriting Techniques and Applications

RTA 2005: Term Rewriting and Applications pp 120–134Cite as

Dependency Pairs for Simply Typed Term Rewriting

  • Conference paper

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

Abstract

Simply typed term rewriting proposed by Yamada (RTA, 2001) is a framework of higher-order term rewriting without bound variables. In this paper, the dependency pair method of first-order term rewriting introduced by Arts and Giesl (TCS, 2000) is extended in order to show termination of simply typed term rewriting systems. Basic concepts such as dependency pairs and estimated dependency graph in the simply typed term rewriting framework are clarified. The subterm criterion introduced by Hirokawa and Middeldorp (RTA, 2004) is successfully extended to the case where terms of function type are allowed. Finally, an experimental result for a collection of simply typed term rewriting systems is presented. Our method is compared with the direct application of the first-order dependency pair method to a first-order encoding of simply typed term rewriting systems.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aoto, T., Yamada, T.: Termination of simply typed term rewriting systems by translation and labelling. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 380–394. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Aoto, T., Yamada, T.: Termination of simply-typed applicative term rewriting systems. In: Proceedings of the 2nd International Workshop on Higher-Order Rewriting (2004)

    Google Scholar 

  3. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1-2), 133–178 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. Giesl, J., Arts, T.: Verification of Erlang processes by dependency pairs. Applicable Algebra in Engineering, Communication and Computing 12(1/2), 39–72 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Giesl, J., Arts, T., Ohlebusch, E.: Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation 34(1), 21–58 (2002)

    Article  MathSciNet  Google Scholar 

  6. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Improving dependency pairs. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol. 2850, pp. 165–179. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing dependency pairs. Research Report 2003–08, Aachener Informatik-Bericht (2003)

    Google Scholar 

  8. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVE. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 210–220. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 32–46. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Hirokawa, N., Middeldorp, A.: Dependency pairs revisited. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 249–268. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Jouannaud, J.-P., Okada, M.: Executable higher-order algebraic specification languages. In: Proceedings of the 6th IEEE Symposium on Logic in Computer Science, pp. 350–361. IEEE Press, Los Alamitos (1991)

    Chapter  Google Scholar 

  12. Klop, J.W.: Combinatory Reduction Systems. PhD thesis, Rijksuniversiteit, Utrecht (1980)

    Google Scholar 

  13. Kusakari, K.: On proving termination of term rewriting systems with higher-order variables. IPSJ Transactions on Programming 42(SIG 7 PRO 11), 35–45 (2001)

    Google Scholar 

  14. Kusakari, K.: Higher-order path orders based on computability. IEICE Transactions on Information and Systems E87–D(2), 352–359 (2003)

    Google Scholar 

  15. Mayr, R., Nipkow, T.: Higher-order rewrite systems and their confluence. Theoretical Computer Science 192(1), 3–29 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Middeldorp, A.: Approximations for strategies and termination. Electronic Notes in Theoretical Computer Science 70(6), 1–20 (2002)

    Article  Google Scholar 

  17. Sakai, M., Kusakari, K.: On new dependency pair method for proving termination of higher-order rewrite systems. In: Proceedings of the International Workshop on Rewriting in Proof and Computation, pp. 176–187 (2001)

    Google Scholar 

  18. Sakai, M., Watanabe, Y., Sakabe, T.: An extension of dependency pair method for proving termination of higher-order rewrite systems. IEICE Transactions on Information and Systems E84–D(8), 1025–1032 (2001)

    Google Scholar 

  19. Thiemann, R., Giesl, J., Schneider-Kamp, P.: Improved modular termination proofs using dependency pairs. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 75–90. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  20. Yamada, T.: Confluence and termination of simply typed term rewriting systems. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol. 2051, pp. 338–352. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute of Electrical Communication, Tohoku University, Japan

    Takahito Aoto

  2. Faculty of Engineering, Mie University, Japan

    Toshiyuki Yamada

Authors
  1. Takahito Aoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toshiyuki Yamada
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LuFG Informatik 2, RWTH Aachen University, Germany

    Jürgen Giesl

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aoto, T., Yamada, T. (2005). Dependency Pairs for Simply Typed Term Rewriting. In: Giesl, J. (eds) Term Rewriting and Applications. RTA 2005. Lecture Notes in Computer Science, vol 3467. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32033-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-32033-3_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25596-3

  • Online ISBN: 978-3-540-32033-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation