Infinitary Rewriting Coinductively

Authors Jörg Endrullis, Andrew Polonsky

Thumbnail PDF


  • Filesize: 479 kB
  • 12 pages

Document Identifiers

Author Details

Jörg Endrullis
Andrew Polonsky

Cite AsGet BibTex

Jörg Endrullis and Andrew Polonsky. Infinitary Rewriting Coinductively. In 18th International Workshop on Types for Proofs and Programs (TYPES 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 19, pp. 16-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)


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.
  • infinitary rewriting
  • coinduction
  • lambda calculus
  • standardization


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads