Vincent van Oostrom  Home/Search
Context Related
| cs.vu.nl/pub/oostrom/HOA95FV.ps.Z 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: fermivista.math.ju...ftp.cs.vu.nl (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The class of orthogonal rewriting systems (rewriting systems where rewrite steps cannot depend on one another) is the main class of not-necessarily-terminating rewriting systems for which confluence is known to hold. Huet and Toyama have shown that for left-linear firstorder term rewriting systems (TRSs) the orthogonality restriction can be relaxed somewhat by allowing critical pairs (arising from maximally general ways of dependence between steps), but requiring them to be parallel... (Update)
Context of citations to this paper: More
.... pairs are not development closed (not even almost, cf. 12] we also cannot use the extensions of Huet s and Toyama s results in [11]. However, permutations always converge and the interaction between reduc tion and permutation is not too intricate. This allows to...
Cited by: More
A Calculus of Lambda Calculus Contexts - Bognar, de Vrijer (2001) (Correct)
Uniform Normalisation beyond Orthogonality - Khasidashvili, Ogawa, van Oostrom (2001) (Correct)
Standardization and Confluence for a Lambda Calculus with.. - Joachimski, Matthes (2000) (Correct)
Active bibliography (related documents): More All
1.0: Finite Family Developments - van Oostrom (1997) (Correct)
0.6: Higher-Order Families - van Oostrom (1996) (Correct)
0.6: Confluence by Developments and Development Closed Critical Pairs - van Oostrom (Correct)
Similar documents based on text: More All
0.3: Perpetuality and Uniform Normalization in Orthogonal.. - Khasidashvili, Ogawa, al. (Correct)
0.2: ARS: an adaptive runtime system for locality optimization - Tao, Schulz, Karl (2003) (Correct)
0.2: Conditional Linearization - de Vrijer (Correct)
Related documents from co-citation: More All
2: Higher-order rewrite systems and their con uence (context) - Mayr, Nipkow - 1998
BibTeX entry: (Update)
Vincent van Oostrom. Development closed critical pairs. In G. Dowek, J. Heering, K. Meinke, and B. Moller, editors, Proceedings of the Second International Workshop on Higher-Order Algebra, Logic and Term Rewriting (HOA '95), Paderborn, Germany, volume 1074 of Lecture Notes in Computer Science, pages 185-200. Springer Verlag, 1996. http://citeseer.ist.psu.edu/vanoostrom96development.html More
@inproceedings{ vanoostrom95development,
author = "Vincent van Oostrom",
title = "Development Closed Critical Pairs",
booktitle = "{HOA}",
pages = "185-200",
year = "1995",
url = "citeseer.ist.psu.edu/vanoostrom96development.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud
474 Term rewriting systems - Klop
251 A logic programming language with lambda-abstraction - Miller - 1991
247 Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980
174 Combinatory Reduction Systems (context) - Klop - 1980
102 Computations in orthogonal rewriting systems (context) - Huet, L'evy
99 Handbook of Theoretical Computer Science (context) - van Leeuwen - 1990
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
56 Unification and anti-unification in the calculus of construc.. - Pfenning
46 Orthogonal higher-order rewrite systems are confluent (context) - Nipkow
37 A general Church-Rosser theorem (context) - Aczel - 1978
34 Higher-order rewrite systems and their confluence - Mayr, Nipkow - 1994
31 Confluence and Normalisation for Higher-Order Rewriting (context) - van Raamsdonk - 1996
31 Weak orthogonality implies confluence: the higher-order case (context) - van Oostrom, van Raamsdonk
29 Transactions of the American Mathematical Society (context) - Church, Rosser et al. - 1936
27 The Church-Rosser theorem in orthogonal combinatory reductio.. (context) - Khasidashvili - 1992
20 Expression reduction systems - Khasidashvili - 1990
20 Comparing combinatory reduction systems and higher-order rew.. - van Oostrom, van Raamsdonk
19 Confluence and superdevelopments (context) - van Raamsdonk - 1993
19 calculi with conditional rules (context) - Takahashi
14 Commutativity of term rewriting systems (context) - Toyama - 1988
10 Background: Computational Structures (context) - Abramsky, Gabbay et al. - 1992
5 Computational Logic: Essays in Honor of Alan Robinson (context) - Lassez, Plotkin - 1991
4 volume 690 of Lecture Notes in Computer Science (context) - Kirchner, Techniques et al. - 1993
3 es. Description Abstraite des Syst`emes de R (context) - Melli - 1995
1 es. An abstract standardisation theorem. pp. 72--81 in LICS (context) - Gonthier, L'evy et al.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.vu.nl.html): More
Models for Asynchronous Message Handling - Langendoen, Bhoedjang, Bal (1997) (Correct)
Orca: a Portable User-Level Shared Object System - Bal, BHOEDJANG, HOFMAN.. (1996) (Correct)
Object Distribution in Orca using Compile-Time and Run-Time.. - Bal, Kaashoek (1993) (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