A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Perpetual Reductions inλ-Calculus
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
doi:10.1006/inco.1998.2750
fatcat:bkd2cfqilncb7mz4dxnr5badau