eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2013-01-21
16
27
10.4230/LIPIcs.TYPES.2011.16
article
Infinitary Rewriting Coinductively
Endrullis, Jörg
Polonsky, Andrew
We provide a coinductive definition of strongly convergent reductions between infinite lambda terms. This approach avoids the notions of ordinals and metric convergence which have appeared in the earlier definitions of the concept. As an illustration, we prove the existence part of the infinitary standardization theorem. The proof is fully formalized in Coq using coinductive types. The paper concludes with a characterization of infinite lambda terms which reduce to themselves in a single beta step.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol019-types2011/LIPIcs.TYPES.2011.16/LIPIcs.TYPES.2011.16.pdf
infinitary rewriting
coinduction
lambda calculus
standardization