Alexandre Boudet, Evelyne Contejean  Home/Search
Context
Related
| lri.fr/~contejea/publis/cade98.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/~contejea/biblio (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the conuence of higher-order pattern rewrite systems modulo an equational theory E. This problem has been investigated by Mayr and Nipkow [13], for the case of rewriting modulo a congruence a la Huet [8], (in particular, the equations of E can be applied above the position where a rewrite rule is applied). The case we address here is rewriting using matching modulo E as done in the rst-order case by Jouannaud and Kirchner [10]. (Update)
Active bibliography (related documents): More All
0.6: The complete list of RTA open problems - Date April Summary (Correct)
0.3: Unknown - Apport De Recherche (Correct)
0.2: Modular & Incremental Proofs of AC-Termination - Marche, Urbain (Correct)
Similar documents based on text: More All
0.5: AC-complete Unification and its Application to Theorem.. - Boudet, Contejean.. (1996) (Correct)
0.4: "Syntactic" AC-Unification - Boudet, Contejean (Correct)
0.4: Proc. of the First CCL Workshop - Domenjoud, Kirchner (1992) (Correct)
BibTeX entry: (Update)
@article{ boudet98about,
author = "Alexandre Boudet and Evelyne Contejean",
title = "About the Confluence of Equational Pattern Rewrite Systems",
journal = "Lecture Notes in Computer Science",
volume = "1421",
pages = "88--??",
year = "1998",
url = "citeseer.ist.psu.edu/629932.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud
384 Simple word problems in universal algebras (context) - Knuth, Bendix - 1970
251 A logic programming language with lambda-abstraction - Miller - 1991
137 Introduction to Combinators and -calculus (context) - Hindley, Seldin - 1986
126 Higher order critical pairs (context) - Nipkow - 1991
74 equivalence (context) - Newman, with et al. - 1942
37 Third order matching is decidable - Dowek - 1992
28 A complete proof of correctness of the Knuth-Bendix completi.. (context) - erard - 1981
20 Con uent reductions: abstract properties and applications to.. (context) - erard - 1980
12 equations dans les langages d'ordre (context) - erard, esolution - 1976
10 Combining algebra and higher-order types (context) - Breazu-Tannen - 1988
8 Normalized rewriting: an alternative to rewriting modulo a s.. - March - 1996
6 Completion of a set of rules modulo a set of equations (context) - Jouannaud, el et al. - 1986
6 Filtrage d'ordre superieur (context) - Padovani - 1996
5 Higher-order rewrite systems and their con uence (context) - Mayr, Nipkow - 1998
3 AC-uni cation of higher-order patterns (context) - Boudet, Contejean - 1997
1 Higher-order rewrite ststems and their con uence (context) - Mayr, Nipkow
1 Note on the undecidability of the second-order uni cation pr.. (context) - Goldfarb - 1981
1 Modular AC-Uni cation of Higher-Order Patterns (context) - Qian, Wang - 1994
Documents on the same site (http://www.lri.fr/~contejea/biblio.html): More
Introducing Global Constraints in CHIP - Beldiceanu, Contejan (1994) (Correct)
Solving Linear Diophantine Constraints Incrementally - Contejean (1993) (Correct)
A partial solution for D-unification based on a reduction to.. - Contejean (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