A Temporal-Logic Approach to Binding-Time Analysis
Author:
Open Access
- 21 June 1995
- journal article
- Published by Det Kgl. Bibliotek/Royal Danish Library in BRICS Report Series
- Vol. 2 (51)
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.Keywords
This publication has 6 references indexed in Scilit:
- Correctness of binding-time analysisJournal of Functional Programming, 2008
- Solving Equations in the lambda-Calculus using Syntactic EncapsulationBRICS Report Series, 1995
- Monadic Second-Order Logic, Graphs and Unfoldings of Transition SystemsBRICS Report Series, 1995
- Two-Level Functional Languages1992
- Inheritance as implicit coercionInformation and Computation, 1991
- A partial evaluator for the untyped lambda-calculusJournal of Functional Programming, 1991