Perpetual Reductions inλ-Calculus

Femke van Raamsdonk, Paula Severi, Morten Heine B. Sørensen, Hongwei Xi
1999 Information and Computation  
This paper surveys a part of the theory of ;-reduction in *-calculus which might aptly be called perpetual reductions. The theory is concerned with perpetual reduction strategies, i.e., reduction strategies that compute infinite reduction paths from *-terms (when possible), and with perpetual redexes, i.e., redexes whose contraction in *-terms preserves the possibility (when present) of infinite reduction paths. The survey not only recasts classical theorems in a unified setting, but also
more » ... new results, proofs, and techniques, as well as a number of applications to problems in *-calculus and type theory. ]
doi:10.1006/inco.1998.2750 fatcat:bkd2cfqilncb7mz4dxnr5badau