Abstract
The Curry-Howard isomorphism identifies proofs with typed lambda-calculus terms, and correspondingly identifies propositions withtypes. We show how this isomorphism can be extended to relateconstructive temporal logic with binding-time analysis. In particular,we show how to extend the Curry-Howard isomorphismto include the ("next") operator from linear-time temporallogic. This yields the simply typed lambda-calculus which we proveto be equivalent to a multi-level binding-time analysis like thoseused in partial evaluation.Keywords: Curry-Howard isomorphism, partial evaluation, binding-time analysis, temporal logic.

This publication has 6 references indexed in Scilit: