Rowan Davies and Frank Pfenning August 1999 CMU-CS-99-153 School of Computer...  Home/Search
Context Related
| cmu.edu/afs/cs/user/...CMUCS99153.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/afs/cs/user/fp/www/pap... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that a type system based on the intuitionistic modal logic S4 provides an expressive framework for specifying and analyzing computation stages in the context of typed lambda-calculi and functional languages. We directly demonstrate the sense in which our calculus captures staging, and also give a conservative embedding of Nielson & Nielson's two-level functional language in our language, thus proving that binding-time correctness is equivalent to modal correctness. In addition, our... (Update)
Cited by: More
Optimizing ML with Run-Time Code Generation - Detex Paper Wc (Correct)
Under consideration for publication in Math. Struct. in .. - Judgmental.. (Correct)
Modal Logics with Existential Modality, Finite-iteration.. - Shkatov (2005) (Correct)
Similar documents (at the sentence level):
65.4%: A Modal Analysis of Staged Computation - Davies, Pfenning (1996) (Correct)
Active bibliography (related documents): More All
0.0: Explicit Provability And Constructive Semantics - Artemov (2001) (Correct)
0.0: Group Knowledge Isn't Always Distributed (Neither Is.. - van der Hoek, van.. (1997) (Correct)
0.0: Strong Cut-Elimination for Constant Domain First-Order S5 - Wansing (1995) (Correct)
Similar documents based on text:
96.0: Unknown - (Correct)
Related documents from co-citation: More All
49: A temporal-logic approach to binding-time analysis - Davies - 1995
38: Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
36: Multi-stage programming with explicit annotations - Taha, Sheard - 1997
BibTeX entry: (Update)
@incollection{ davies96modal,
author = "Rowan Davies and Frank Pfenning",
title = "A Modal Analysis of Staged Computation",
booktitle = "Conf.\ Record 23rd {ACM} {SIGPLAN}/{SIGACT} Symp.\ on Principles of Programming Languages, {POPL}'96, St.~Petersburg Beach, {FL}, {USA}, 21--24 Jan 1996",
publisher = "ACM Press",
address = "New York",
pages = "258--270",
year = "1996",
url = "citeseer.ist.psu.edu/davies96modal.html" }
Citations (may not include all citations):142 Logic programming with focusing proofs in linear logic - Andreoli - 1992
52 Intuitionistic necessity revisited - Bierman, de Paiva - 1992
51 Computational types from a logical perspective - Benton, Bierman et al. - 1998
39 A simple applicative language: Mini-ML (context) - Cl'ement, Despeyroux et al. - 1986
14 Coming to Term with Modal Logic: On the Interpretation of Mo.. (context) - Borghuis - 1994
2 Available as Technical Report DIKU-report (context) - Birkedal, Welinder et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/afs/cs/user/fp/www/papers/): More
Linear Higher-Order Pre-Unification - Cervesato, Pfenning (1997) (Correct)
System Description: Twelf - A Meta-Logical Framework for.. - Pfenning, Schürmann (1999) (Correct)
On Equivalence and Canonical Forms in the LF Type Theory.. - Harper, Pfenning (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