Name
Abstract | ||
|---|---|---|
We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly generalise a number of results on normalising strategies in first-order infinitary rewriting and provide the first examples of normalising strategies for infinitary lambda-calculus. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.2168/LMCS-6(1:7)2010 | LOGICAL METHODS IN COMPUTER SCIENCE |
Keywords | Field | DocType |
term rewriting,higher-order computation,combinatory reduction systems,lambda-calculus,infinite computation,reduction strategies,normal forms | Discrete mathematics,Lambda calculus,Rewriting,Mathematics | Journal |
Volume | Issue | ISSN |
6 | 1 | 1860-5974 |
Citations | PageRank | References |
5 | 0.59 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jeroen Ketema | 1 | 160 | 13.52 |
| Jakob Grue Simonsen | 2 | 317 | 44.16 |
| Henk Barendregt | 3 | 588 | 92.49 |