Name
Abstract | ||
|---|---|---|
Expression Reduction Systems is a formalism for higher-order rewriting, extending Term Rewriting Systems and the lambda-calculus. Here we give an overview of results in the literature concerning ERSs. We review confluence, normalization and perpetuality results for orthogonal ERSs. Some of these results are extended to orthogonal conditional ERSs. Further, ERSs with patterns are introduced and their confluence is discussed. Finally, higher-order rewriting is translated into equational first-order rewriting. The technique develops an isomorphic model of ERSs with variable names, based on de Bruijn indices. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11601548_22 | Processes, Terms and Cycles |
Keywords | Field | DocType |
higher order,lambda calculus,first order | Discrete mathematics,Lambda calculus,Context-sensitive language,Normalization (statistics),Computer science,Isomorphism,Confluence,Rewriting,De Bruijn sequence,Formalism (philosophy) | Conference |
Volume | ISSN | ISBN |
3838 | 0302-9743 | 3-540-30911-X |
Citations | PageRank | References |
7 | 0.46 | 61 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John R. W. Glauert | 1 | 77 | 9.24 |
| Delia Kesner | 2 | 369 | 39.75 |
| Zurab Khasidashvili | 3 | 307 | 25.40 |