Eindhoven University of Technology Department of Computer Science P.O. Box...  Home/Search
Context
Related
| win.tue.nl/~akoprows/coqhor...horpo.ps Cached: PS.gz PS This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PDF Image Update HelpPS.gz PS From: win.tue.nl/~akopro...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Recursive path ordering (RPO) is a well-known reduction ordering introduced by Dershowitz [6], that is useful for proving termination of term rewriting systems (TRSs). Jouannaud and Rubio generalized this ordering to the higher-order case thus creating the higher-order recursive path ordering (HORPO) [8]. They proved that this ordering can be used for proving termination of higher-order TRSs which essentially comes down to proving well-foundedness of the union of HORPO and #- reduction... (Update)
Active bibliography (related documents): More All
1.2: Well-Foundedness of the Recursive Path Ordering in Coq - de Kleijn, Koprowski, van.. (2004) (Correct)
0.9: Well-foundedness of the higher-order recursive path ordering in.. - Koprowski (2004) (Correct)
0.3: Recursive Path Ordering for Infinite Labelled - Rewrite Systems Adam (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ of-certified,
author = "Eindhoven University Of",
title = "Certified Higher-Order Recursive Path Ordering Adam Koprowski",
url = "citeseer.ist.psu.edu/742337.html" }
Citations (may not include all citations):214 Orderings for term-rewriting systems (context) - Dershowitz - 1982
66 Handbook of logic in computer science (context) - Barendregt, with - 1992
60 Extracting constructive content from classical proofs (context) - Murthy - 1990
42 Program extraction from normalization proofs (context) - Berger, Berghofer et al. - 2005
35 Lambda-calculus notation with nameless dummies: a tool for a.. (context) - de Bruijn - 1972
29 The higher-order recursive path ordering - Jouannaud, Rubio - 1999
28 Executable higher order algebraic specification languages (context) - Jouannaud, Okada - 1991
6 Termination proof of term rewriting systems with the multise.. (context) - Leclerc - 1995
5 Type theory and the integrated logic of programs (context) - Persson - 1999
5 Higher-order recursive path orderings `a la carte (context) - Jouannaud, Rubio - 2001
3 A constructive proof of Higman's lemma in Isabelle (context) - Berghofer - 2004
3 volume 55 of Cambridge Tracts in TCS (context) - van Raamsdonk, Systems - 2003
2 Well-foundedness of the higher-order recursive path ordering.. - Koprowski - 2004
1 A Constructive Axiomatization of the Recursive Path Ordering (context) - Coupet-Grimal, Delobel - 2006
http://www.win.tue.nl/
Documents on the same site (http://www.win.tue.nl/~akoprows/publications.html): More
Well-Foundedness of the Recursive Path Ordering in Coq - de Kleijn, Koprowski, van.. (2004) (Correct)
Proving Liveness with Fairness using Rewriting - Koprowski, Zantema (2005) (Correct)
Proving Liveness with Fairness using Rewriting - Koprowski, Zantema (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC