Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Logic in Computer Science
2015-07-01 v3
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.
Keywords
Cite
@article{arxiv.0912.4947,
title = {Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies},
author = {Jeroen Ketema and Jakob Grue Simonsen},
journal= {arXiv preprint arXiv:0912.4947},
year = {2015}
}