Relative Normalization in Orthogonal Expression Reduction Systems

@inproceedings{Glauert1994RelativeNI,
  title={Relative Normalization in Orthogonal Expression Reduction Systems},
  author={John R. W. Glauert and Zurab Khasidashvili},
  booktitle={CTRS},
  year={1994}
}
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évy, we introduce the notion of with respect to a set of reductions or a set of terms so that each existing notion of neededness can be given by specifying or . We imposed natural conditions on , called , that are sufficient and necessary for each term not in -normal form… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 33 references

University of East Anglia

Kennaway, Sleep M.R. Neededness is hypernormalizing in regular com Preprint, School of Information Systems
Norwich, • 1989
View 14 Excerpts
Highly Influenced

127

Klop J.W. Combinatory Reduction Systems. Mathematical C n
CWI, Amsterdam, • 1980
View 20 Excerpts
Highly Influenced

La stratégie paresseuse

L Maranget
Thèse de l’Université de Paris VII, • 1992
View 5 Excerpts
Highly Influenced

Report 1825

Khasidashvili Z. The Church-Rosser theorem in Orthogonal Combina Systems
INRIA Rocquencourt, • 1992
View 3 Excerpts
Highly Influenced

A con ict between callbyneed computation and parallelism

R. KennawayJ.
1994

Con uence for Abstract and Higher - Order Rewriting

V. VanOostrom
1994

In: Proc

S. Antoy, R. Echahed, strategy Hanus M. A needed narrowing
of the 21 ACM Symposium on Principles of Programming Languages, POPL’94, Portland, Oregon, • 1994
View 1 Excerpt

Similar Papers

Loading similar papers…