(Enter summary)
Abstract: Confluence of orthogonal rewriting systems can be proved using the Finite Developments
Theorem. We present, in a general setting, several adaptations of this proof method
for obtaining confluence of `not quite' orthogonal systems.
1. Introduction
Rewriting as studied here is based on the analogy: rewriting = substitution + rules. This
analogy is useful since it enables a clearcut distinction between the `designer' defined substition
process, i.e. management of resources, and the `user'... (Update)
Context of citations to this paper: More
...makes strongly confluent) 3.4. 6 Vincent van Oostrom 94 Vincent van Oostrom translated the Huet s result to complete developments ( vO 94] Lemma 3.4.6.1 Let R be a left linear term rewriting system, such that for every critical pair (P,Q) P 1 Q. Then 1 satisfies the...
Cited by: More
A Survey of Abstract Rewriting - Bognar (1995)
(Correct)
On the Power of Simple Diagrams - Di Cosmo (1996)
(Correct)
Similar documents (at the sentence level):
20.9%: Confluence by Developments and Development Closed Critical Pairs - van Oostrom
(Correct)
Active bibliography (related documents): More All
0.4: Proof nets, Garbage, and Computations - Guerrini, Martini, Masini
(Correct)
0.3: Development Closed Critical Pairs - van Oostrom (1996)
(Correct)
0.2: Higher-Order Families - van Oostrom (1996)
(Correct)
Similar documents based on text: More All
0.1: Weak Orthogonality Implies Confluence: the Higher-Order Case - van Oostrom, van Raamsdonk (1994)
(Correct)
0.1: pi-Calculus Semantics of Moded Flat GHC - Hirata (1995)
(Correct)
0.1: Supporting Document on E2 - Corporation (1998)
(Correct)
BibTeX entry: (Update)
V. van Oostrom. Developing developments. Draft, 1994. http://citeseer.ist.psu.edu/vanoostrom94developing.html More
@article{ vanoostrom97developing,
author = "Vincent van Oostrom",
title = "Developing Developments",
journal = "Theoretical Computer Science",
volume = "175",
number = "1",
pages = "159-181",
year = "1997",
url = "citeseer.ist.psu.edu/vanoostrom94developing.html" }
Citations (may not include all citations):
788
Rewrite systems
- Dershowitz, Jouannaud - 1990
474
Term rewriting systems
- Klop - 1992
247
Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980
174
Combinatory reduction systems (context) - Klop, van Oostrom et al. - 1993
174
Combinatory Reduction Systems (context) - Klop - 1980
99
Handbook of Theoretical Computer Science (context) - van Leeuwen - 1990
96
al IEEE Symposium on Logic in Computer Science, Santa Cruz, .. (context) - the, Annu - 1992
65
volume 103 of Studies in Logic and the Foundations of Mathem.. (context) - Barendregt, Calculus et al. - 1984
57
Confluence for Abstract and Higher-Order Rewriting (context) - van Oostrom - 1994
46
Orthogonal higher-order rewrite systems are confluent (context) - Nipkow - 1993
41
Interaction systems I: The theory of optimal reductions
- Asperti, Laneve - 1994
34
Higher-order rewrite systems and their confluence
- Mayr, Nipkow - 1994
33
From proof-nets to interaction nets
- Lafont - 1994
31
Weak orthogonality implies confluence: the higher-order case (context) - van Oostrom, van Raamsdonk - 1994
19
calculi with conditional rules (context) - Takahashi - 1993
14
Commutativity of term rewriting systems (context) - Toyama - 1988
13
Linear logic without boxes
- Gonthier, Abadi et al.
10
Background: Computational Structures (context) - Abramsky, Gabbay et al. - 1992
8
Logical Foundations of Computer Science (context) - Nerode, Matiyasevich - 1994
6
A confluent reduction for the extensional typed -calculus wi.. (context) - Di Cosmo, Kesner - 1993
3
Interaction systems II: The practice of optimal reductions
- Asperti, Laneve - 1994
1
th International Colloquium (context) - Lingas, Karlsson et al. - 1993
Documents on the same site (http://www.phil.uu.nl/~oostrom/publication/rewriting.html): More
Perpetuality and Uniform Normalization in Orthogonal.. - Khasidashvili, Ogawa, al.
(Correct)
FD à la Melliès - van Oostrom
(Correct)
Higher-Order Families - van Oostrom (1996)
(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