A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
Journal of the ACM
The Curry-Howard isomorphism identifies proofs with typed λcalculus terms, and correspondingly identifies propositions with types. We show how this isomorphism can be extended to relate constructive temporal logic with binding-time analysis. In particular, we show how to extend the Curry-Howard isomorphism to include the ("next") operator from linear-time temporal logic. This yields the simply typed λ -calculus which we prove to be equivalent to a multi-level binding-time analysis like those used in partial evaluation.doi:10.1145/3011069 fatcat:es7u5yv3rjhdzbbyj2slcglqly