Vincent van Oostrom, Roel de Vrijer  Home/Search
Context
Related
| cs.vu.nl/~rdv/wrs.pdf 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: cs.vu.nl/~rdv/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Two co-initial reductions in a term rewriting system are said to be equivalent if they perform the same steps, albeit maybe in a di#erent order. We present four characterisations of such a notion of equivalence, based on permutation, standardisation, labelling and projection, respectively. We prove that the characterisations all yield the same notion of equivalence, for the class of first-order left-linear term rewriting systems. A crucial role in our development is played by the notion of a... (Update)
Active bibliography (related documents): More All
1.1: Descendants and Origins in Term Rewriting - Bethke, Klop, de Vrijer (1999) (Correct)
0.6: Stable Results and Relative Normalization - Glauert, Kennaway, Khasidashvili (Correct)
0.5: The Geometry of Conflict-free Reduction Spaces - Khasidashvili, Glauert (1998) (Correct)
Similar documents based on text: More All
0.3: A Calculus of Lambda Calculus Contexts - Bognar, de Vrijer (2001) (Correct)
0.2: An Example Paper - Name (Correct)
0.2: How Many Argument Digits are Needed to Produce n Result Digits? - Heckmann (1999) (Correct)
BibTeX entry: (Update)
@misc{ oostrom-four,
author = "Vincent van Oostrom and Roel de Vrijer",
title = "Four Equivalent Equivalences of Reductions",
url = "citeseer.ist.psu.edu/vanoostrom02four.html" }
Citations (may not include all citations):901 Transaction Processing Concepts and Techniques (context) - Gray, Reuter - 1993
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
502 Concurrency and automata on infinite sequences (context) - Park - 1981
484 A Calculus of Communicating Systems (context) - Milner - 1980
474 Term rewriting systems - Klop - 1992
299 Conditional rewriting logic as a unified model of concurrenc.. (context) - Meseguer - 1992
259 Combinatory Logic (context) - Curry, Feys - 1958
174 Combinatory Reduction Systems (context) - Klop - 1980
144 Models for concurrency - Winskel, Nielsen - 1995
99 volume 5 of Graduate Texts in Mathematics (context) - Lane, the et al. - 1998
92 Concurrent program schemes and their interpretation (context) - Mazurkiewicz - 1977
74 equivalence (context) - Newman, with et al. - 1942
70 Average-case analysis of algorithms and data structures - Vitter, Flajolet - 1990
67 Computational semantics of term rewriting systems (context) - Boudol - 1985
50 Concurrent transition systems - Stark - 1989
49 Equational term graph rewriting - Ariola, Klop - 1996
39 Transactions of the American Mathematical Society (context) - Hindley, normal - 1978
35 An abstract standardisation theorem - Gonthier, Levy et al. - 1992
29 Transactions of the American Mathematical Society (context) - Church, Rosser et al. - 1936
23 Computations in orthogonal rewriting systems (context) - Huet, Levy - 1991
23 The Optimal Implementation of Functional Programming Languag.. (context) - Asperti, Guerrini - 1998
20 Expression reduction systems - Khasidashvili - 1990
19 Theoretical Computer Science (context) - Mart-Oliet, Meseguer et al. - 2002
19 volume 53 of Cambridge Tracts in Theoretical Computer Scienc.. (context) - Blackburn, de Rijke et al. - 2001
17 An abstract form of the Church--Rosser theorem (context) - Hindley - 1969
13 Mathematical Structures in Computer Science (context) - Laneve, Montanari et al. - 1996
11 La strategie paresseuse (context) - Maranget - 1992
11 Comparing logics for rewriting: rewriting logic (context) - Gadducci, Montanari - 2002
11 Introduction to the rewriting calculus (context) - Cirstea, Kirchner - 1999
8 Towards a proof theory of rewriting: The simply typed 2#-cal.. (context) - Hilken - 1996
8 Discrete normalization and standardization in deterministic .. - Khasidashvili, Glauert - 1996
7 the Journal of Symbolic Logic (context) - Rosser - 1956
6 The Church--Rosser Theorem (context) - Schroer - 1965
6 volume 55 of Cambridge Tracts in Theoretical Computer Scienc.. (context) - Rewriting - 2003
5 Description Abstraite des Systemes de Reecriture (context) - Mellies - 1996
5 Reductions correctes et optimales dans le #-calcul (context) - Levy - 1978
3 a stability theorem in rewriting theory (context) - Mellies, theory - 1998
3 Normalisation in weakly orthogonal rewriting - van Oostrom - 1999
3 Relating conflict-free stable transition and event models vi.. - Khasidashvili, Glauert - 2002
2 a factorisation theorem in rewriting theory (context) - Mellies, theory - 1997
2 Finite family developments (context) - van Oostrom - 1997
1 calculus enjoys finite normalisation cones (context) - Mellies, theory - 2000
1 LudwigMaximilians -Universitat Munchen (context) - Joachimski, of et al. - 2001
1 a diagrammatic standardization theorem (context) - Mellies, theory - 2002
1 FD a la Mellies (context) - van Oostrom - 1997
1 Axiomatic rewriting theory VI (context) - Mellies - 2002
1 A new proof of the Church--Rosser theorem (context) - Curry - 1952
1 Term rewriting and Hoare logic -- coded rewriting (context) - Sun - 1996
1 Optimal derivations in orthogonal term rewriting systems and.. (context) - Maranget - 1991
Documents on the same site (http://www.cs.vu.nl/~rdv/papers.html): More
Conditional Linearization - de Vrijer (Correct)
The context calculus λc (Extended Abstract) - Bognar, de Vrijer (1999) (Correct)
Extending Partial Combinatory Algebras - Bethke, Klop, de Vrijer (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