A Lambda-Free Higher-Order Recursive Path Order - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

A Lambda-Free Higher-Order Recursive Path Order

Abstract

We generalize the recursive path order (RPO) to higher-order terms without λ-abstraction. This new order fully coincides with the standard RPO on first-order terms also in the presence of currying, distinguishing it from previous work. It has many useful properties, including well-foundedness, transitivity, stability under substitution, and the subterm property. It appears promising as the basis of a higher-order superposition calculus.
Fichier principal
Vignette du fichier
BlanchetteWaldmannWandFoSSaCS.pdf (190.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01592189 , version 1 (27-09-2017)

Identifiers

Cite

Jasmin Christian Blanchette, Uwe Waldmann, Daniel Wand. A Lambda-Free Higher-Order Recursive Path Order. Foundations of Software Science and Computation Structures, 20th International Conference (FOSSACS 2017), Apr 2017, Uppsala, Sweden. pp.461-479, ⟨10.1007/978-3-662-54458-7_27⟩. ⟨hal-01592189⟩
122 View
133 Download

Altmetric

Share

Gmail Facebook X LinkedIn More