| |
VOLUME 6, ISSUE 1, PAPER 7
|
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
|
©Jeroen Ketema, Tohoku University
©Jakob Grue Simonsen, University of Copenhagen
|
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.
|
Publication date: February 26, 2010
Full Text: PDF | PostScript
DOI: 10.2168/LMCS-6(1:7)2010
Hit Counts: 1191 |
 Creative Commons | |
