Name
Abstract | ||
|---|---|---|
In orthogonal expression reduction systems, a common generalization of term rewriting and λ-calculus, we extend the concepts of normalization and needed reduction by considering, instead of the set of normal forms, a set S of 'results'. When S satisfies some simple axioms which we call stability, we prove the corresponding generalizations of some fundamental theorems: the existence of needed redex... |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1093/logcom/10.3.323 | Journal of Logic and Computation |
Keywords | Field | DocType |
rewrite systems,normalizing strategy,needed reduction,stable sets of results,minimal and optimal normalization,high-order rewriting | Discrete mathematics,Normalization (statistics),Generalization,Axiom,Algorithm,Rewriting,Mathematics | Journal |
Volume | Issue | ISSN |
10 | 3 | 0955-792X |
Citations | PageRank | References |
6 | 0.44 | 29 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John R. W. Glauert | 1 | 145 | 12.14 |
| Richard Kennaway | 2 | 435 | 47.65 |
| Zurab Khasidashvili | 3 | 307 | 25.40 |