J.-P. Jouannaud, A. Rubio  Home/Search
Context Related
| lri.fr/LRI/articles/...horpolics.ps.gz lsi.upc.es/~albert/pape...lics99a.ps.gz Cached: PS.gz PS PDF 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.
Image Update HelpPS.gz PS PDF From: lri.fr/~jouannau/biblio (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 fi-reductions and with polymorphic typing, monotonic with respect to the function symbols, and stable under substitution. It can therefore be used to prove the strong... (Update)
Cited by: More
Certified Higher-Order Recursive Path Ordering Adam Koprowski - Eindhoven University Of (Correct)
A Formalization of the Simply Typed Lambda - Calculus In Coq (Correct)
Definitions by Rewriting in the Calculus of Constructions - Blanqui (2001) (Correct)
Similar documents (at the sentence level): More
29.8%: Higher-Order Recursive Path Orderings - Jouannaud, Rubio (1999) (Correct)
15.4%: Higher-Order Recursive Path Orderings à la carte - Jouannaud, Rubio (Correct)
14.7%: A Monotonic Higher-Order Semantic Path Ordering - Borralleras, Rubio (2000) (Correct)
Active bibliography (related documents): More All
1.8: The Higher-Order Recursive Path Ordering - Jouannaud, Rubio (1999) (Correct)
0.3: Higher-Order Equational Logic - Prehofer (1997) (Correct)
0.2: An LPO-based Termination Ordering for Higher-Order Terms.. - Lifantsev, Bachmair (1998) (Correct)
Similar documents based on text: More All
0.3: A Recursive Path Ordering for Higher-Order Terms in.. - Jouannaud, Rubio (1996) (Correct)
0.2: Paramodulation with Built-in AC-Theories and Symbolic.. - Nieuwenhuis, Rubio (1996) (Correct)
0.2: Inductive Data Type Systems: Strong Normalization - Jouannaud, Okada (1997) (Correct)
Related documents from co-citation: More All
16: Theoretical Computer Science (context) - Jouannaud, Okada et al. - 1997
16: Rewrite systems - Dershowitz, Jouannaud - 1990
15: Lambda Calculi with Types - Barendregt - 1992
BibTeX entry: (Update)
J.-P. Jouannaud and A. Rubio. The higher-order recursive path ordering. In Proc. of LICS'99, 1999. http://citeseer.ist.psu.edu/jouannaud99higherorder.html More
@inproceedings{ jouannaud99higherorder,
author = "J.-P. Jouannaud and A. Rubio",
title = "The Higher-Order Recursive Path Ordering",
booktitle = "Proceedings of the 14th Annual Symposium on Logic in Computer Science ({LICS}'99)",
publisher = "IEEE Computer Society Press",
address = "Trento, Italy",
editor = "G. Longo",
pages = "402--411",
year = "1999",
url = "citeseer.ist.psu.edu/jouannaud99higherorder.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990
214 Orderings for term rewriting systems (context) - Dershowitz - 1982
145 Isabelle: the next 700 theorem provers (context) - Paulson - 1990
71 Elf: A language for logic definition and verified meta-progr.. - Pfenning - 1989
66 Handbook of Logic in Computer Science (context) - Barendregt - 1993
37 The coq proof assistant user's guide version (context) - Dowek, Felty et al.
35 Theoretical Computer Science (context) - Jouannaud, Okada et al. - 1997
34 Higher-order rewrite systems and their confluence - Mayr, Nipkow - 1998
26 Strict functionals for termination proofs (context) - Pol, Schwichtenberg - 1995
25 Type Theory and Programming - Coquand, Nordstrom et al. - 1994
18 A termination ordering for higher order rewrite systems - Lysne, Piris - 1995
13 The Calculus of Algebraic Constructions - Blanqui, Jouannaud et al. - 1999
11 A fully syntactic AC-RPO - Rubio - 1999
10 chapter Functional Programming and Lambda Calculus (context) - Barendregt, Theoretical et al. - 1990
7 Rapport de recherche INRIA (context) - Dowek, Hardin et al. - 1998
5 rewrite and -calculus) systems (context) - Lora-Saenz, Steinbach et al. - 1992
4 the theory of quasi ordinal diagrams (context) - Okada, Takeuti - 1986
4 A Recursive Path Ordering for Higher-Order Terms in j-Long f.. (context) - Jouannaud, Rubio - 1999
2 Rewrite orderings for higherorder terms in j-long fi-normal .. (context) - Jouannaud, Rubio - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lri.fr/~jouannau/biblio.html): More
Inductive Data Type Systems - Blanqui, Jouannaud, Okada (1998) (Correct)
A Recursive Path Ordering for Higher-Order Terms in.. - Jouannaud, Rubio (1996) (Correct)
The Higher-Order Recursive Path Ordering - Jouannaud, Rubio (1999) (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