Richard Mayr, Tobias Nipkow  Home/Search
Context Related
| liafa.jussieu.fr/~mayr/TUMI9433.ps 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: liafa.jussieu.fr/~mayr/reports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce Higher-Order Rewrite Systems (HRS) which extend term rewriting to -terms. HRS can describe computations on arbitrary terms with bound variables. We show that rewriting is closely related to undirected equational reasoning, and extend three confluence results from term rewriting to HRS: the critical pair lemma by Knuth and Bendix, confluence of rewriting modulo equations à la Huet, and confluence of orthogonal HRS. (Update)
Context of citations to this paper: More
.... notions of higher order rewriting defined by Klop (Combinatory Reduction Systems [30,31] Nipkow (Higher order Rewrite Systems [39,34]) and van Raamsdonk and van Oostrom (Higher Order Rewriting Systems [49,50] generalizing both) are based on higher order pattern...
...of future work. 2 Preliminaries We first describe the meta language of simply typed # calculus. The notation is roughly consistent with [2, 9, 15]. 2.1 The Simply Typed # Calculus Starting with a fixed set of base types B, the set of all types is the closure of B under...
Cited by: More
Higher-Order Functional-Logic Programming: A Systematic Development - Prehofer (1997) (Correct)
Higher-Order Narrowing with Convergent - Systems Christian Prehofer (1995) (Correct)
Higher-Order Recursive Path Orderings à la carte - Jouannaud, Rubio (Correct)
Similar documents (at the sentence level):
51.8%: Higher-Order Rewrite Systems and their Confluence - Mayr, Nipkow (Correct)
Active bibliography (related documents): More All
0.3: Higher-Order Narrowing - Prehofer (1994) (Correct)
0.2: A Reduction Ordering for Higher-Order Terms - Avenhaus.. (1995) (Correct)
0.2: Problems in Rewriting III - Dershowitz, Jouannaud, Klop (1995) (Correct)
Similar documents based on text: More All
0.9: An Optimal Algorithm for Constructing the Reduced Gröbner.. - Koppenhagen, Mayr (Correct)
0.9: Optimal Gröbner Base Algorithms for Binomial Ideals - Koppenhagen, Mayr (1996) (Correct)
0.9: The Complexity of the Equivalence Problem for Commutative.. - Koppenhagen, Mayr (1996) (Correct)
Related documents from co-citation: More All
17: Higher-order critical pairs (context) - Nipkow - 1991
16: A logic programming language with lambda-abstraction - Miller - 1991
15: Rewrite systems - Dershowitz, Jouannaud - 1990
BibTeX entry: (Update)
Richard Mayr and Tobias Nipkow. Higher-order rewrite systems and their confluence. Theoretical Computer Science. To appear. http://citeseer.ist.psu.edu/309043.html More
@article{ mayr98higherorder,
author = "Richard Mayr and Tobias Nipkow",
title = "Higher-order rewrite systems and their confluence",
journal = "Theoretical Computer Science",
volume = "192",
number = "1",
pages = "3--29",
year = "1998",
url = "citeseer.ist.psu.edu/309043.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990 ACM DBLP
384 Simple word problems in universal algebra (context) - Knuth, Bendix - 1970
251 A logic programming language with lambda-abstraction - Miller - 1991
247 Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980 ACM DBLP
166 An overview of Prolog (context) - Nadathur, Miller - 1988
137 Introduction to Combinators and - Calculus (context) - Hindley, Seldin - 1986
126 Higher-order critical pairs (context) - Nipkow - 1991 DBLP
97 The undecidability of the second-order unification problem (context) - Goldfarb - 1981 DBLP
81 Isabelle: A Generic Theorem Prover (context) - Paulson - 1994
72 Logic for Computer Science (context) - Gallier - 1986 ACM
62 Term rewriting systems (context) - Klop - 1992 ACM
57 Confluence for Abstract and Higher-Order Rewriting (context) - van Oostrom - 1994
46 Orthogonal higher-order rewrite systems are confluent (context) - Nipkow - 1993 ACM DBLP
37 A general Church-Rosser theorem (context) - Aczel - 1978
36 Functional unification of higher-order patterns (context) - Nipkow - 1993 DBLP
31 Weak orthogonality implies confluence: the higher-order case (context) - van Oostrom, van Raamsdonk - 1994 ACM
30 Combinatory Reduction Systems (context) - Klop - 1980 ACM
30 Combinatory reduction systems (context) - Klop, van Oostrom et al. - 1993 ACM
26 Modularity of strong normalization and confluence in the alg.. - Barbanera, Fern'andez et al. - 1994
23 its Syntax and Semantics (context) - Barendregt, Calculus - 1984
22 Cambridge Tracts in Theoretical Computer Science (context) - Wolfram, Theory - 1993
21 Adding algebraic rewriting to the untyped lambda-calculus - Dougherty - 1991
20 Comparing combinatory reduction systems and higher-order rew.. - van Oostrom, van Raamsdonk - 1994 ACM DBLP
19 calculi with conditional rules (context) - Takahashi - 1993
19 Confluence and superdevelopments (context) - van Raamsdonk - 1993 ACM DBLP
19 Termination proofs for higher-order rewrite systems - Pol - 1994 ACM DBLP
13 Confluence of the lambda-calculus with left-linear algebraic.. (context) - Muller - 1992
10 and Proof Theory (context) - Stenlund, -Terms - 1972
7 Lambda calculi with types (context) - Barendregt - 1992 ACM
4 A Theoretical Framework for Reasoning about Program Construc.. (context) - Lor'ia-S'aenz - 1993
2 Konfluenz bei Termersetzungssystemen auf -Termen (context) - Mayr - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.liafa.jussieu.fr/~mayr/reports.html): More
Simulation Preorder on Simple Process Algebras - Kucera, Mayr (1999) (Correct)
Weak Bisimilarity with Infinite-State Systems can be Decided.. - Kucera, Mayr (1999) (Correct)
Model Checking PA-Processes - Mayr (1997) (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