HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Termination and Confluence of Higher-Order Rewrite Systems

Abstract : In the last twenty years, several approaches to higher-order rewriting have been proposed, among which Klop's Combinatory Rewrite Systems (CRSs), Nipkow's Higher-order Rewrite Systems (HRSs) and Jouannaud and Okada's higher-order algebraic specification languages, of which only the last one considers typed terms. The later approach has been extended by Jouannaud, Okada and the present author into Inductive Data Type Systems (IDTSs). In this paper, we extend IDTSs with the CRS higher-order pattern-matching mechanism, resulting in simply-typed CRSs. Then, we show how the termination criterion developed for IDTSs with first-order pattern-matching, called the General Schema, can be extended so as to prove the strong normalization of IDTSs with higher-order pattern-matching. Next, we compare the unified approach with HRSs. We first prove that the extended General Schema can also be applied to HRSs. Second, we show how Nipkow's higher-order critical pair analysis technique for proving local confluence can be applied to IDTSs.
Document type :
Conference papers
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download

Contributor : Frédéric Blanqui Connect in order to contact the contributor
Submitted on : Wednesday, October 11, 2006 - 3:30:05 PM
Last modification on : Thursday, July 8, 2021 - 3:47:53 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 7:22:42 PM




Frédéric Blanqui. Termination and Confluence of Higher-Order Rewrite Systems. Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Jul 2000, Norwich, United Kingdom. ⟨inria-00105556⟩



Record views


Files downloads