See this document in CiteSeerX!

Relative Normalization in Stable Deterministic Residual Structures (1996)  (Make Corrections)  (2 citations)
John Glauert, Zurab Khasidashvili
Colloquium on Trees in Algebra and Programming



  Home/Search   Context   Related

 
View or download:
sys.uea.ac.uk/~zurab...SYSC9605.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  sys.uea.ac.uk/~zurab/re...reports (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper generalizes the Huet and L'evy theory of normalization by neededness to an abstract setting. We define Stable Deterministic Residual Structures (SDRS) and Deterministic Family Structures (DFS) by axiomatizing some properties of the residual relation and the family relation on redexes in an Abstract Reduction System. We present two proofs of the Relative Normalization Theorem, one for SDRSs for regular stable sets, and another for DFSs for all stable sets of desirable `normal... (Update)

Context of citations to this paper:   More

...N : t g f(c) Then we have Q L N , P is external to N , but not to Q; and P is not external to U = fa; g(a)g. Lemma 2. 1 ([GlKh96, GlKh96a]) Let P : t s be external to a complete development N of a set of redexes U t, in a DRS, and let Q : t o, then P=Q is external to...

...discrete neededness and essentiality notions which we introduce later employ that subtlety. The following three lemmas are taken from [GlKh96, GlKh96a]. For convenience, we include the proofs. Technical Report SYS C96 06 UEA Norwich, UK Discrete Normalization and...

Cited by:   More
Discrete Normalization and Standardization in Stable.. - Khasidashvili, Glauert (1996)   (Correct)
Discrete Normalization and Standardization in.. - Khasidashvili, Glauert (1996)   (Correct)

Similar documents (at the sentence level):   More
59.9%:   Relative Normalization in Deterministic Residual Structures - Glauert, Khasidashvili (1996)   (Correct)
7.4%:   Zig-zag and Extraction Families in Non-duplicating Stable .. - Khasidashvili, Glauert   (Correct)
6.5%:   Zig-zag, Extraction and Separable Families in.. - Khasidashvili, Glauert   (Correct)

Active bibliography (related documents):   More   All
1.4:   Minimal Relative Normalization in Orthogonal Expression.. - Glauert, Khasidashvili (1996)   (Correct)
1.1:   The Geometry of Conflict-free Reduction Spaces - Khasidashvili, Glauert (1998)   (Correct)
0.8:   Stable Results and Relative Normalization - Glauert, Kennaway, Khasidashvili   (Correct)

Similar documents based on text:   More   All
1.7:   Relative Normalization in Orthogonal Expression Reduction.. - Glauert, Khasidashvili (1994)   (Correct)
0.8:   Cv - Bosson   (Correct)
0.8:   Relating Conflict-free Stable Transition and Event Models .. - Khasidashvili, Glauert   (Correct)

Related documents from co-citation:   More   All
2:   Melli`es P.-A. Description Abstraite des Syst`emes de R'e'ecriture. Th`ese de l'Universit 'e Paris 7, 1996.
2:   Confluence and normalisation for higher-order rewriting (context) - Van Raamsdonk - 1996
2:   Needed Reduction and spine strategies for the lambda calculus (context) - Barendregt, Kennaway et al. - 1987

BibTeX entry:   (Update)

Glauert J.R.W., Khasidashvili Z. Relative normalization in stable deterministic residual structures. Report SYS-C96-01, UEA, Norwich, 1996. http://citeseer.ist.psu.edu/article/glauert96relative.html   More

@inproceedings{ glauert96relative,
    author = "John R. W. Glauert and Zurab Khasidashvili",
    title = "Relative Normalization in Deterministic Residual Structures",
    booktitle = "Colloquium on Trees in Algebra and Programming",
    pages = "180-195",
    year = "1996",
    url = "citeseer.ist.psu.edu/article/glauert96relative.html" }
Citations (may not include all citations):
474   Term Rewriting Systems - Klop - 1992
259   Combinatory Logic (context) - Curry, Feys - 1958
247   Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980
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
169   A Call-By-Need Lambda Calculus - Ariola, Felleisen et al. - 1995
168   Theoretical Computer Science (context) - Nielsen, Plotkin et al. - 1981
102   Computations in Orthogonal Rewriting Systems (context) - Huet, L'evy - 1991
71   Transfinite reductions in orthogonal term rewriting - Kennaway, Klop et al. - 1995
63   Optimal reductions in the Lambda-calculus (context) - L'evy - 1980
62   Combinatory reduction systems: introduction and survey - Klop, van Oostrom et al. - 1993
50   Concurrent transition systems - Stark - 1989
46   Orthogonal higher-order rewrite systems are confluent (context) - Nipkow - 1993
44   Programming in Equational Logic: Beyond Strong Sequentiality - Sekar, Ramakrishnan - 1993
41   R'eductions correctes et optimales dans le lambda-calcul (context) - L'evy - 1978
41   Interaction Systems I: The theory of optimal reductions - Asperti, Laneve - 1993
35   An abstract Standardisation theorem - Gonthier, L'evy et al. - 1992
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 - 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
24   A Sequential Reduction Strategy - Antoy, Middeldorp - 1994
22   Higher order families - Van Oostrom - 1996
18   On higher order recursive program schemes (context) - Khasidashvili - 1994
17   An abstract form of the Church-Rosser theorem (context) - Hindley - 1969
14   Neededness is hypernormalizing in regular combinatory reduct.. (context) - Kennaway, Sleep - 1989
14   Relative normalization in deterministic residual structures - Khasidashvili - 1996
13   Optimal reduction in weak -calculus with shared environments (context) - Yoshida - 1993
13   ese de l'Universit'e de Paris VII (context) - strat'egie, Th - 1992
12   Event structures and orthogonal term graph rewriting (context) - Kennaway, Klop et al. - 1993
11   Relative Normalization in Orthogonal Expression Reduction Sy.. - Khasidashvili - 1994
8   Compilation and Programming Techniques (context) - Functional - 1994
6   Optimal derivations in weak -calculi and in orthogonal Term .. (context) - Maranget - 1991
6   Sequential evaluation strategy for parallel-or and related r.. (context) - Kennaway - 1989
5   Events in Computation (context) - Winskel - 1980
5   Mod'eles compl'etement ad'equats et stables des -calculs typ.. (context) - Berry - 1979
5   Minimal and optimal relative normalization in Expression Red.. (context) - Khasidashvili - 1994
3   Relating conflict-free stable transition and event models - Khasidashvili, Glauert
1   Technical Report SYS-C96-05 UEA Norwich (context) - for, Higher-Order et al. - 1994

Documents on the same site (http://www.sys.uea.ac.uk/~zurab/reports/reports.html):   More
Higher Order Recursive Program Schemes are Turing Incomplete - Khasidashvili (1993)   (Correct)
Perpetuality and Uniform Normalization (Extended Abstract) - Khasidashvili, Ogawa   (Correct)
The Geometry of Conflict-free Reduction Spaces - Khasidashvili, Glauert (1998)   (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