Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

LICS
1999
IEEE

favoriteEmaildiscussreport

114views Automated Reasoning» more LICS 1999»

The Higher-Order Recursive Path Ordering

13 years 8 months ago

The Higher-Order Recursive Path Ordering

Download www.lix.polytechnique.fr

This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed lambda-calculus generated by a signature of polymorphic higher-order function symbols. The obtained ordering is well-founded, compatible with

Jean-Pierre Jouannaud, Albert Rubio

Real-time Traffic

Automated Reasoning | Function Symbols | LICS 1999 | Polymorphic Rewrite Rule | Polymorphic Typing |

claim paper

Related Content

» On ModelChecking Trees Generated by HigherOrder Recursion Schemes

» HigherOrder Critical Pairs

» Inferring Cost Equations for Recursive Polymorphic and HigherOrder Functional Programs

» Partial Recursive Functions in HigherOrder Logic

» Recursive Functions with Higher Order Domains

» A Practical Linear Time Algorithm for Trivial Automata Model Checking of HigherOrder Recur...

» Semantics of HigherOrder Recursion Schemes

» On Global Model Checking Trees Generated by HigherOrder Recursion Schemes

» HigherOrder MultiParameter Tree Transducers and Recursion Schemes for Program Verification

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	LICS
Authors	Jean-Pierre Jouannaud, Albert Rubio

Comments (0)