Rowan Davies and Frank Pfenning Carnegie Mellon University We show that a...  Home/Search
Context Related
| cmu.edu/~fp/papers/jacm00.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/~fp/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we show that they can also be motivated logically, and that the proper logical system for expressing computation stages is the intuitionistic variant of the modal logic S4 [Prawitz 1965]. This observation immediately gives rise to a natural generalization of standard binding-time analysis by allowing multiple computation stages, initiation of successor stages, and sharing of code across multiple stages. Such extensions are normally considered external issues. For example, Jones... (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):
79.3%: A Modal Analysis of Staged Computation - Davies, Pfenning (1996) (Correct)
Active bibliography (related documents): More All
0.6: A Judgmental Reconstruction of Modal Logic - Pfenning, Davies (2001) (Correct)
0.5: Macros as Multi-Stage Computations: Type-Safe, Generative.. - Ganz, Sabry, Taha (Correct)
0.5: Relating Categorical and Kripke Semantics for.. - Alechina, de Paiva.. (1998) (Correct)
Similar documents based on text:
0.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)
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In ACM Symposium on Principles of Programming Languages, January 1996. To appear. An earlier version is available as Technical Report CMU--CS--95--145, School of Computer Science, Carnegie Mellon University. http://citeseer.ist.psu.edu/article/davies96modal.html More
@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/article/davies96modal.html" }
Citations (may not include all citations):638 Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
343 Modal Logic: an Introduction (context) - Chellas - 1980
291 Computational lambda calculus and monads - Moggi - 1989
210 Logic programming in the LF logical framework - Pfenning - 1991
143 A modal analysis of staged computation - Davies, Pfenning - 1996
142 Logic programming with focusing proofs in linear logic - Andreoli - 1992
133 Multi-stage programming with explicit annotations - Taha, Sheard - 1997
132 A general approach for run-time specialization and its appli.. - Consel, No - 1996
123 Optimizing ML with run-time code generation - Lee, Leone - 1996
116 Natural Deduction (context) - Prawitz - 1965
99 A partial evaluator for the untyped lambda-calculus - Gomard, Jones - 1991
92 Reflection and semantics in Lisp (context) - Smith - 1984
87 Notions of computation and monads - Moggi - 1991
80 A temporal-logic approach to binding-time analysis - Davies - 1996
73 and machine-independent dynamic code generation (context) - Engler, Hsieh et al. - 1996
66 Primitive recursion for higherorder abstract syntax (context) - Despeyroux, Pfenning et al. - 1997
53 Multi-stage programming: Axiomatization and type safety - Taha, Benaissa et al. - 1998
52 Intuitionistic necessity revisited - Bierman, de Paiva - 1996
51 Two-Level Functional Languages (context) - Nielson, Nielson - 1992
51 Computational types from a logical perspective - Benton, Bierman et al. - 1998
43 A taste of linear logic - Wadler - 1993
38 A computational interpretation of modal proofs - Martini, Masini - 1996
38 Partial evaluation of Standard ML (context) - Birkedal, Welinder - 1993
34 An idealized MetaML: Simpler (context) - Moggi, Taha et al. - 1999
34 A case for runtime code generation (context) - Keppel, Eggers et al. - 1993
31 Correctness of binding time analysis - Palsberg - 1993
28 Run-time code generation and modal-ML - Wickline, Lee et al. - 1998
22 the unity of logic (context) - Girard - 1993
21 a modal -calculus (context) - Pfenning, Wong - 1995
20 Modal types as staging specifications for run-time code gene.. - Wickline, Lee et al. - 1998
16 the meanings of the logical constants and the justifications.. (context) - of, On - 1996
15 Compilers and staging transformations (context) - Jrring, Scherlis - 1986
14 Coming to Terms with Modal Logic: On the Interpretation of M.. (context) - Borghuis - 1994
14 Mechanically verifying the correctness of an offline partial.. - Hatcliff - 1995
10 Programming languages capturing complexity classes (context) - Hofmann - 2000
10 Semantic analysis of modal logic (context) - Kripke - 1963
6 A judgmental reconstruction of modal logic - Pfenning, Davies - 2000
5 Propositional lax logic - Fairtlough, Mendler - 1997
4 Monad as modality (context) - Kobayashi - 1997
4 Efficient algebraic operations on programs - Jones - 1993
3 On computational interpretations of the modal logic S4 (context) - Goubault-Larrecq - 1996
3 A mixed modal/linear lambda calculus with applications to Be.. - Hofmann - 1998
2 Efficient multi-level generating extensions for program spec.. - uck, Jrgensen - 1995
1 and Kahn (context) - Cl'ement, Despeyroux et al.
1 On computational interpretations of the modal logic S4 - III.. (context) - Goubault-Larrecq - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/~fp/publications.html): More
Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004) (Correct)
Compiler Verification in LF - Hannan, Pfenning (1992) (Correct)
Meta-Programming with Names and Necessity - Nanevski, Pfenning (2002) (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