(Enter summary)
Abstract: 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 fl ("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... (Update)
Cited by: More
Contextual Model Type Theory - Nanevski, Pfenning, Pientka (2005)
(Correct)
A Modal Analysis of Staged Computation - Rowan Davies And (1996)
(Correct)
Staged Computation with Names and Necessity - Nanevski, Pfenning (2005)
(Correct)
Similar documents (at the sentence level):
38.5%: A Temporal-Logic Approach to Binding-Time Analysis - Davies (1995)
(Correct)
Active bibliography (related documents): More All
0.3: Partial Evaluation and Correctness - Welinder (1997)
(Correct)
0.0: On a Modal \lambda-Calculus for S4* - Pfenning, Wong (1995)
(Correct)
0.0: Electronic Notes in Computer Science 1 (1995) - On Modal Calculus (1995)
(Correct)
Similar documents based on text: More All
1.2: The Girard Translation Extended with Recursion - Braüner (1995)
(Correct)
1.1: Semantics-Based Compiling: A Case Study in Type-Directed.. - Danvy, Vestergaard (1996)
(Correct)
1.1: Cut-Elimination for Full Intuitionistic Linear Logic - Braüner, de Paiva (1996)
(Correct)
Related documents from co-citation: More All
69: A modal analysis of staged computation
- Davies, Pfenning - 1996
48: Multi-stage programming with explicit annotations
- Taha, Sheard - 1997
40: Multi-stage programming: Axiomatization and type safety
- Taha, Benaissa et al. - 1998
BibTeX entry: (Update)
Rowan Davies. A temporal-logic approach to binding-time analysis. Research Series RS-9551, BRICS, Department of Computer Science, University of Aarhus, October 1995. http://citeseer.ist.psu.edu/davies95temporallogic.html More
@inproceedings{ davies96temporallogic,
author = "Rowan Davies",
title = "A Temporal-Logic Approach to Binding-Time Analysis",
booktitle = "Logic in Computer Science",
pages = "184-195",
year = "1996",
url = "citeseer.ist.psu.edu/davies95temporallogic.html" }
Citations (may not include all citations):
638
Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
233
The formulae-as-types notion of construction (context) - Howard
210
Logic programming in the LF logical framework
- Pfenning - 1991
202
Modal and temporal logics (context) - Stirling - 1992
99
A partial evaluator for the untyped lambda-calculus
- Gomard, Jones - 1991
51
Two-Level Functional Languages (context) - Nielson, Nielson - 1992
50
A simple applicative language: Mini-ML (context) - Cl'ement, Despeyroux et al.
38
A computational interpretation of modal proofs
- Martini, Masini - 1995
31
Correctness of binding time analysis
- Palsberg - 1993
22
Extending the curryhoward interpretation to linear (context) - Gabbay, de Queiroz - 1992
15
Inheritance as implicit coercion
- Breazu-Tannen, Coquand et al. - 1991
3
Very efficient conversions (context) - Welinder
1
Efficient multi-level generating extensions for program spec.. (context) - Gluck, Jrgensen - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/RS/95/Ref/BRICS-RS-95-Ref/): More
MONA: Monadic Second-Order Logic in Practice - Henriksen, Jensen.. (1995)
(Correct)
Compositional Model Checking of Real Time Systems - Laroussinie, al. (1995)
(Correct)
A Semantic Theory for Value-Passing Processes Late.. -.. (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC