Name
Abstract | ||
|---|---|---|
. We define a perpetual one-step reduction strategy which enablesone to construct minimal (w.r.t. L'evy's ordering \Theta on reductions) infinite reductionsin Conditional Orthogonal Expression Reduction Systems. We usethis strategy to derive two characterizations of perpetual redexes, i.e., redexeswhose contractions retain the existence of infinite reductions. These characterizationsgeneralize existing related criteria for perpetuality of redexes. Wegive a number of applications of our... |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/BFb0027014 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
uniform normalization | Discrete mathematics,Reduction strategy,Lambda calculus,Normalization (statistics),Pure mathematics,Equivalence (measure theory),Rewriting,Normalization property,Fixed point equation,Mathematics,Calculus | Conference |
ISBN | Citations | PageRank |
3-540-63459-2 | 6 | 0.52 |
References | Authors | |
14 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zurab Khasidashvili | 1 | 307 | 25.40 |
| Mizuhito Ogawa | 2 | 135 | 23.17 |