(Enter summary)
Abstract: . We study reductions in orthogonal (left-linear and non-ambiguous)
Expression Reduction Systems, a formalism for Term Rewriting
Systems with bound variables and substitutions. To generalise the
normalization theory of Huet and L'evy, we introduce the notion of neededness
with respect to a set of reductions \Pi or a set of terms S so that
each existing notion of neededness can be given by specifying \Pi or S. We
imposed natural conditions on S, called stability, that are sufficient and... (Update)
Context of citations to this paper: More
...the conditions for stability and still retain the concept of relative neededness. For example, an alternative definition is explored in [13, 12] where a stable set S is closed under unneeded expansion and closed under parallel moves : for any t ## S, any P : t ## o # S,...
...narrowing strategy. Gardner [Gar94] describes a complete way of encoding neededness information using a type assignment system. In [GlKh94], the present authors address the question of normalization relative to a desired set of final terms, considering the properties that a...
Cited by: More
Descendants and Origins in Term Rewriting - Bethke, Klop, de Vrijer (1999)
(Correct)
Normalization of Typable Terms by Superdevelopments - Khasidashvili, Piperno (1999)
(Correct)
Discrete Normalization and Standardization in Stable.. - Khasidashvili, Glauert (1996)
(Correct)
Similar documents (at the sentence level):
47.3%: Minimal and Optimal Relative Normalization in Orthogonal.. - Glauert, Khasidashvili (1996)
(Correct)
41.4%: Relative Normalization in Orthogonal Expression Reduction.. - Glauert, Khasidashvili (1994)
(Correct)
9.0%: Minimal Relative Normalization in Orthogonal Expression.. - Glauert, Khasidashvili (1996)
(Correct)
Active bibliography (related documents): More All
0.6: Relative Normalization in Stable Deterministic Residual.. - Glauert, Khasidashvili (1996)
(Correct)
0.5: Discrete Normalization and Standardization in.. - Khasidashvili, Glauert (1996)
(Correct)
0.5: On the Longest Perpetual Reductions in Orthogonal Expression.. - Khasidashvili (2000)
(Correct)
Similar documents based on text: More All
1.0: Decidable Call by Need Computations in Term Rewriting.. - Durand, Middeldorp (1997)
(Correct)
0.8: Stable Results and Relative Normalization - Glauert, Kennaway, Khasidashvili
(Correct)
0.6: Relative Normalization in Deterministic Residual Structures - Glauert, Khasidashvili (1996)
(Correct)
Related documents from co-citation: More All
11: Combinatory Reduction System (context) - Klop - 1980
10: An abstract standardisation theorem
- Gonthier, L'evy et al. - 1992
10: Optimal normalization in orthogonal term rewriting systems
- Khasidashvili - 1993
BibTeX entry: (Update)
Glauert J.R.W., Khasidashvili Z. Relative Normalization in Orthogonal Expression Reduction Systems. In: Proc. of the 4 th International workshop on Conditional (and Typed) Term Rewriting Systems, CTRS'94, Springer LNCS, vol. 968, N. Dershowitz, ed. Jerusalem, 1994, p. 144-165. http://citeseer.ist.psu.edu/article/glauert94relative.html More
@inproceedings{ glauert94relative,
author = "John R. W. Glauert and Zurab Khasidashvili",
title = "Relative Normalization in Orthogonal Expression Reduction Systems",
booktitle = "Conditional Term Rewriting Systems",
pages = "144-165",
year = "1994",
url = "citeseer.ist.psu.edu/article/glauert94relative.html" }
Citations (may not include all citations):
788
Rewrite Systems
- Dershowitz, Jouannaud - 1990
474
Term Rewriting Systems
- Klop - 1992
210
its Syntax and Semantics (context) - Lambda - 1984
174
Combinatory Reduction Systems (context) - Klop - 1980
171
A needed narrowing strategy
- Antoy, Echahed et al. - 1994
102
Computations in Orthogonal Rewriting Systems (context) - Huet, L'evy - 1991
63
Optimal reductions in the Lambda-calculus (context) - L'evy - 1980
62
Combinatory reduction systems: introduction and survey
- Klop, van Oostrom et al. - 1993
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 - 1993
41
R'eductions correctes et optimales dans le lambda-calcul (context) - L'evy - 1978
37
A general Church-Rosser theorem (context) - Aczel - 1978
31
Weak orthogonality implies confluence: the higher-order case (context) - Van Oostrom, van Raamsdonk - 1994
28
Needed Reduction and spine strategies for the lambda calculu.. (context) - Barendregt, Kennaway et al. - 1987
27
The Church-Rosser theorem in Orthogonal Combinatory Reductio.. (context) - Khasidashvili - 1992
25
Optimal normalization in orthogonal term rewriting systems
- Khasidashvili - 1993
22
Cambridge Tracts in Theoretical Computer Science (context) - Clausal, Types - 1993
20
Expression Reduction Systems
- Khasidashvili - 1990
18
On higher order recursive program schemes (context) - Khasidashvili - 1994
17
Discovering needed reductions using type theory
- Gardner - 1994
14
Neededness is hypernormalizing in regular combinatory reduct.. (context) - Kennaway, Sleep - 1989
14
A conflict between call-by-need computation and parallelism
- Kennaway - 1994
13
Some problems of the Notation Theory (context) - Sh - 1977
13
ese de l'Universit'e de Paris VII (context) - strat'egie, Th - 1992
8
Compilation and Programming Techniques (context) - Functional - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.sys.uea.ac.uk/~zurab/conferences/conferences.html): More
On the Equivalence of Persistent Term Rewriting Systems and.. - Khasidashvili (1993)
(Correct)
The Geometry of Orthogonal Reduction Spaces - Khasidashvili, Glauert (1997)
(Correct)
β-Reductions and β-Developments of λ-Terms.. - Khasidashvili
(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