research-article

Normal Higher-Order Termination

Authors:

Jean-Pierre Jouannaud,

Albert RubioAuthors Info & Claims

ACM Transactions on Computational Logic (TOCL), Volume 16, Issue 2

Article No.: 13, Pages 1 - 38

https://doi.org/10.1145/2699913

Published: 09 March 2015 Publication History

Abstract

We extend the termination proof methods based on reduction orderings to higher-order rewriting systems based on higher-order pattern matching. We accommodate, on the one hand, a weakly polymorphic, algebraic extension of Church’s simply typed λ-calculus and, on the other hand, any use of eta, as a reduction, as an expansion, or as an equation. The user’s rules may be of any type in this type system, either a base, functional, or weakly polymorphic type.

References

[1]

1991. Proceedings of the 6th Annual Symposium on Logic in Computer Science (LICS’91). IEEE Computer Society.

[2]

Hendrick Pieter Barendregt. 1993. Lambda calculus with types. In Handbook of Logic in Computer Science, Volume 2, Abramsky et al. (Eds.). Oxford University Press, 117--309.

Digital Library

[3]

Frédéric Blanqui. 2006. Higher-order dependency pairs. In Proceedings of the 8th International Workshop on Termination (WST’06).

[4]

Frédéric Blanqui. 2007. Computability closure: Ten years later. In Rewriting, Computation and Proof (Lecture Notes in Computer Science), Hubert Comon-Lundh, Claude Kirchner, and Hélène Kirchner (Eds.), Vol. 4600. Springer, 68--88.

[5]

Frédéric Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada. 1999. The calculus of algebraic constructions. In RTA (Lecture Notes in Computer Science), Paliath Narendran and Michaël Rusinowitch (Eds.), Vol. 1631. Springer, 301--316.

Digital Library

[6]

Frédéric Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada. 2002. Inductive-data-type systems. Theoretical Computer Science 272, 1--2 (2002), 41--68.

Digital Library

[7]

Frédéric Blanqui, Jean-Pierre Jouannaud, and Albert Rubio. 2008. The computability path ordering: The end of a quest. In CSL (Lecture Notes in Computer Science), Michael Kaminski and Simone Martini (Eds.), Vol. 5213. Springer, 1--14.

Digital Library

[8]

Frédéric Blanqui, Jean-Pierre Jouannaud, and Albert Rubio. 2013. The Computability Path Ordering. (2013). Accepted for publication in Logical Methods for Computer Science.

[9]

Miquel Bofill, Cristina Borralleras, Enric Rodrguez-Carbonell, and Albert Rubio. 2012. The recursive path and polynomial ordering for first-order and higher-order terms. Journal of Logic and Computation (2012).

Digital Library

[10]

Cristina Borralleras and Albert Rubio. 2001. A monotonic higher-order semantic path ordering. In LPAR (Lecture Notes in Computer Science), Robert Nieuwenhuis and Andrei Voronkov (Eds.), Vol. 2250. Springer, 531--547.

Digital Library

[11]

Roberto Di Cosmo and Delia Kesner. 1994. Simulating expansions without expansions. Mathematical Structures in Computer Science 4, 3 (1994), 315--362.

[12]

Nachum Dershowitz. 1982. Orderings for term-rewriting systems. Theoretical Computer Science 17 (1982), 279--301.

[13]

Nachum Dershowitz and Jean-Pierre Jouannaud. 1990. Rewrite systems. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B). Elsevier, 243--320.

Digital Library

[14]

Carsten Fuhs and Cynthia Kop. 2012. Polynomial interpretations for higher-order rewriting. In RTA (LIPIcs), Ashish Tiwari (Ed.), Vol. 15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 176--192.

[15]

Gérard P. Huet. 1980. Confluent reductions: Abstract properties and applications to term rewriting systems: Abstract properties and applications to term rewriting systems. Journal of the ACM 27, 4 (1980), 797--821.

Digital Library

[16]

Jean-Pierre Jouannaud. 2005. Higher-order rewriting: Framework, confluence and termination. In Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday. Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, and Roel C. de Vrijer (Eds.). Lecture Notes in Computer Science, Vol. 3838. Springer, 224--250.

Digital Library

[17]

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

Digital Library

[18]

Jean-Pierre Jouannaud and Jianqi Li. 2012. Church-rosser properties of normal rewriting. In CSL (LIPIcs), Patrick Cégielski and Arnaud Durand (Eds.), Vol. 16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 350--365.

[19]

Jean-Pierre Jouannaud and Mitsuhiro Okada. 1991. A computation model for executable higher-order algebraic specification languages. In LICS. IEEE Computer Society, 350--361.

[20]

Jean-Pierre Jouannaud and Albert Rubio. 1999. The higher-order recursive path ordering. In LICS. IEEE Computer Society, 402--411.

Digital Library

[21]

Jean-Pierre Jouannaud and Albert Rubio. 2006. Higher-order orderings for normal rewriting. In RTA (Lecture Notes in Computer Science), F. Pfenning (Ed.), Vol. 4098. Springer, 387--399.

Digital Library

[22]

Jean-Pierre Jouannaud and Albert Rubio. 2007. Polymorphic higher-order recursive path orderings. Journal of the ACM 54, 1 (2007), Article No. 2, 48.

Digital Library

[23]

Cynthia Kop. 2012. Higher Order Termination. Ph.D. Dissertation. VU University Amsterdam, Amsterdam, The Netherlands.

[24]

Cynthia Kop and Femke van Raamsdonk. 2010. Higher-order dependency pairs with argument filterings. In Proceedings of the 11th International Workshop on Termination (WST’10).

[25]

Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, and Frédéric Blanqui. 2009. Static dependency pair method based on strong computability for higher-order rewrite systems. IEICE Transactions on Information and Systems E92-D, 10 (2009), 2007--2015.

[26]

Richard Mayr and Tobias Nipkow. 1998. Higher-order rewrite systems and their confluence. Theoretical Computer Science 192, 1 (1998), 3--29.

Digital Library

[27]

Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, and Roel C. de Vrijer (Eds.). 2005. Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, Vol. 3838. Springer.

Digital Library

[28]

Dale Miller. 1991. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logical Computing 1, 4 (1991), 497--536.

[29]

Tobias Nipkow. 1991. Higher-order critical pairs. In LICS. IEEE Computer Society, 342--349.

[30]

Tobias Nipkow and Lawrence C. Paulson. 1992. Isabelle-91. In CADE (Lecture Notes in Computer Science), Deepak Kapur (Ed.), Vol. 607. Springer, 673--676.

Digital Library

[31]

Gerald E. Peterson and Mark E. Stickel. 1981. Complete sets of reductions for some equational theories. Journal of the ACM 28, 2 (1981), 233--264.

Digital Library

[32]

Jaco van de Pol. 1996. Termination of Higher-Order Rewrite Systems. Ph.D. Dissertation. Utrecht Universiteit, Utrecht, The Netherlands.

[33]

Masahiko Sakai and Keiichirou Kusakari. 2005. On dependency pair method for proving termination of higher-order rewrite systems. IEICE Transactions on Information and Systems E88-D, 3 (2005), 583--593.

Digital Library

[34]

Masahiko Sakai, Yoshitsugu Watanabe, and Toshiki Sakabe. 2001. An extension of dependency pair method for proving termination of higher-order rewrite systems. IEICE Transactions on Information and Systems E84-D, 8 (2001), 1025--1032.

[35]

Sho Suzuki, Keiichirou Kusakari, and Frédéric Blanqui. 2011. Argument filterings and usable rules in higher-order rewrite systems. IPSJ Transactions on Programming 4, 2 (2011), 1--12.

[36]

Terese. 2003. Term rewriting systems. In Cambridge Tracts in Theoretical Computer Science, Marc Bezem, Jan Willem Klop, and Roel de Vrijer (Eds.). Cambridge University Press.

[37]

Jaco van de Pol. 1993. Termination proofs for higher-order rewrite systems. In HOA (Lecture Notes in Computer Science), Jan Heering, Karl Meinke, Bernhard Möller, and Tobias Nipkow (Eds.), Vol. 816. Springer, 305--325.

Digital Library

[38]

Jaco van de Pol and Helmut Schwichtenberg. 1995. Strict functionals for termination proofs. In TLCA (Lecture Notes in Computer Science), Mariangiola Dezani-Ciancaglini and Gordon D. Plotkin (Eds.), Vol. 902. Springer, 350--364.

Digital Library

[39]

Femke van Raamsdonk. 2001. On termination of higher-order rewriting. In RTA (Lecture Notes in Computer Science), Aart Middeldorp (Ed.), Vol. 2051. Springer, 261--275.

Digital Library

[40]

Daria Walukiewicz-Chrzaszcz. 2003. Termination of rewriting in the Calculus of Constructions. Journal of Functional Programming 13, 2 (2003), 339--414.

Digital Library

Cited By

Hamana MAbe TKikuchi K(2019)Polymorphic computation systems: Theory and practice of confluence with call-by-valueScience of Computer Programming10.1016/j.scico.2019.102322(102322)Online publication date: Oct-2019
https://doi.org/10.1016/j.scico.2019.102322
Hamana M(2018)Polymorphic Rewrite Rules: Confluence, Type Inference, and Instance ValidationFunctional and Logic Programming10.1007/978-3-319-90686-7_7(99-115)Online publication date: 24-Apr-2018
https://doi.org/10.1007/978-3-319-90686-7_7

Index Terms

Normal Higher-Order Termination
1. Theory of computation

Recommendations

Polymorphic higher-order recursive path orderings

This article extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed lambda-calculus generated by a signature of polymorphic higher-order ...
Relating Higher-order and First-order Rewriting

We define a formal encoding from higher-order rewriting into first-order rewriting modulo an equational theory. In particular, we obtain a characterization of the class of higher-order rewriting systems which can be encoded by first-order rewriting ...
Primitive recursion for higher-order abstract syntax

Higher-order abstract syntax is a central representation technique in logical frameworks which maps variables of the object language into variables of the meta-language. It leads to concise encodings, but is incompatible with functions defined by ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computational Logic

ACM Transactions on Computational Logic Volume 16, Issue 2

March 2015

260 pages

ISSN:1529-3785

EISSN:1557-945X

DOI:10.1145/2737801

Editor:
Dale Miller
INRIA Saclay, France

Issue’s Table of Contents

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 March 2015

Accepted: 01 November 2014

Revised: 01 September 2014

Received: 01 December 2013

Published in TOCL Volume 16, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
105
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)1

Reflects downloads up to 10 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Hamana MAbe TKikuchi K(2019)Polymorphic computation systems: Theory and practice of confluence with call-by-valueScience of Computer Programming10.1016/j.scico.2019.102322(102322)Online publication date: Oct-2019
https://doi.org/10.1016/j.scico.2019.102322
Hamana M(2018)Polymorphic Rewrite Rules: Confluence, Type Inference, and Instance ValidationFunctional and Logic Programming10.1007/978-3-319-90686-7_7(99-115)Online publication date: 24-Apr-2018
https://doi.org/10.1007/978-3-319-90686-7_7

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents