Bernhard Gramlich  Home/Search
Context Related
| logic.at/staff/gra...852bg9901.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: logic.at/staff/gramlich/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: For a complete, i.e., confluent and terminating term rewriting system (TRS) it is well-known that simplification (also called interreduction) into an equivalent canonical, i.e., complete and interreduced TRS is easily possible. This can be achieved by first normalizing all right-hand sides of the TRS and then deleting all rules with a reducible left-hand side. Here we investigate the logical and operational preservation properties of the same simplification operations for semi-complete,... (Update)
Context of citations to this paper: More
.... and the equational theory (as well as con uence, normalization and the equational theory, in almost orthogonal and normalizing TRSs) [13], and the removal of trivial rules does not change the evaluation semantics of the TRS R either, we have the following. Corollary 1. Let...
Cited by: More
Removing Redundant Arguments Automatically - M.Alpuente, S.Escobar, S.Lucas (2004) (Correct)
Removing Redundant Arguments of Functions - Alpuente, Escobar, Lucas (2002) (Correct)
Similar documents (at the sentence level):
30.0%: On Semi-Completeness of Term Rewriting Systems - Bernhard Gramlich (1997) (Correct)
Active bibliography (related documents): More All
2.1: On Interreduction of Semi-Complete Term Rewriting Systems - Gramlich (2001) (Correct)
0.4: Unique normal form property of compatible term rewriting.. - Mano, Ogawa (1999) (Correct)
0.2: A New Parallel Closed Condition for Church-Rosser of.. - Oyamaguchi, Ohta (1997) (Correct)
Similar documents based on text: More All
0.3: Modular Termination of Context-Sensitive Rewriting - Gramlich, Lucas (2002) (Correct)
0.3: A Classification of Locally Semicomplete Digraphs - Bang-Jensen, Guo, Gutin.. (Correct)
0.3: A polynomial algorithm for the Hamiltonian cycle problem.. - Bang-Jensen, Gutin, Yeo (1996) (Correct)
Related documents from co-citation: More All
2: Term Rewriting and All That (context) - Baader, Nipkow - 1998
2: Partial deduction of the ground representation and its application to integrity .. - Leuschel, Martens - 1995
2: Meaningless Terms in Rewriting - Kennaway, van Oostrom et al. - 1996
BibTeX entry: (Update)
B. Gramlich. On Interreduction of Semi-Complete Term Rewriting Systems. Theoretical Computer Science, 258(1-2):435-451, 2001. http://citeseer.ist.psu.edu/article/gramlich99interreduction.html More
@article{ gramlich01interreduction,
author = "Bernhard Gramlich",
title = "On interreduction of semi-complete term rewriting systems",
journal = "Theoretical Computer Science",
volume = "258",
number = "1--2",
pages = "435--451",
year = "2001",
url = "citeseer.ist.psu.edu/article/gramlich99interreduction.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990
247 Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980
88 Computing in Systems Described by Equations (context) - O'Donnell - 1977
79 the Church-Rosser property for the direct sum of term rewrit.. (context) - Toyama - 1987
62 Term rewriting systems (context) - Klop - 1992
54 Tree-manipulating systems and Church-Rosser theorems (context) - Rosen - 1973
45 Call by need computations to root-stable form - Middeldorp - 1997
44 Programming in equational logic: Beyond strong sequentiality - Sekar, Ramakrishnan - 1993
31 Weak orthogonality implies confluence: The higher-order case (context) - van Oostrom, van Raamsdonk - 1994
30 Unification in a combination of arbitrary disjoint equationa.. (context) - Schmidt-Schau - 1989
28 A complete proof of correctness of the Knuth-Bendix completi.. (context) - Huet - 1981
27 More problems in rewriting - Dershowitz, Jouannaud et al. - 1993
26 Texts and Monographs in Computer Science (context) - Book, Otto et al. - 1993
15 Unique normal forms in term rewriting systems with repeated .. (context) - Chew - 1981
13 Unique normal forms for lambda calculus with surjective pair.. (context) - Klop, de Vrijer - 1989
10 Vrije Universiteit Amsterdam (context) - van Raamsdonk, Normalization et al. - 1996
8 About the rewriting systems produced by the KnuthBendix comp.. (context) - M'etivier - 1983
6 Normalisation in weakly orthogonal rewriting - van Oostrom - 1999
4 Research Notes in Theoretical Computer Science (context) - Bachmair, Proofs - 1989
4 the Church-Rosser property of non-E-overlapping and strongly.. (context) - Gomi, Oyamaguchi et al. - 1996
3 mail communication (context) - Middeldorp - 1997
3 Rewriting-list contribution 388: Semi-completeness and reduc.. (context) - Kahrs - 1995
2 On semi-completeness of term rewriting systems - Gramlich - 1997
Documents on the same site (http://www.logic.at/staff/gramlich/papers.html): More
A Constructor-Based Approach to Positive/Negative-Conditional .. - Wirth, Gramlich (1993) (Correct)
On Termination and Confluence Properties of Disjoint and.. - Gramlich (1996) (Correct)
On Termination and Confluence of Conditional Rewrite Systems - Gramlich (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