Rowan Davies and Frank Pfenning Department of Computer Science Carnegie...  Home/Search
Context Related
| cmu.edu/user/fp/www/pape...popl96.ps.gz cmu.edu/project/fox/mosa...popl96.ps.gz cmu.edu/afs/cs/user/rowan/ww...mlbox.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/user/fp/www/homepage (more) From: cmu.edu/afs/cs/user/r...abstracts (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 functional languages. Our main technical result is a conservative embedding of Nielson & Nielson's two-level functional language in our language Mini-ML 2 , thus proving that bindingtime correctness is equivalent to modal correctness on this fragment. In addition Mini-ML 2 can also express immediate evaluation and sharing of ... (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):
42.0%: A Modal Analysis of Staged Computation - Davies, Pfenning (1999) (Correct)
Active bibliography (related documents): More All
0.2: A Temporal-Logic Approach to Binding-Time Analysis - Davies (1995) (Correct)
0.1: Sound Specialization in the Presence of Computational Effects - Lawall, Thiemann (1997) (Correct)
0.1: MetaML and Multi-Stage Programming with Explicit Annotations - Taha, Sheard (1999) (Correct)
Similar documents based on text: More All
0.3: Lectures on the Curry-Howard Isomorphism - Sørensen, Urzyczyn (1998) (Correct)
0.2: Multi-Stage Imperative Languages: A Conservative Extension.. - Calcagno, Moggi (2000) (Correct)
0.1: Multi-Stage Programming with Explicit Annotations - Sheard (1997) (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
291 Computational lambda calculus and monads - Moggi - 1989
210 Logic programming in the LF logical framework - Pfenning - 1991
99 A partial evaluator for the untyped lambda-calculus - Gomard, Jones - 1991
81 Refinement types for ML - Freeman, Pfenning - 1991
80 A temporal-logic approach to binding-time analysis - Davies - 1995
64 Efficient type inference for higher-order binding-time analy.. - Henglein - 1991
52 Intuitionistic necessity revisited - Bierman, de Paiva - 1992
51 TwoLevel Functional Languages (context) - Nielson, Nielson - 1992
50 A simple applicative language: Mini-ML (context) - Cl'ement, Despeyroux et al. - 1986
46 Reflection and semantics in Lisp (context) - Smith - 1984
38 A computational interpretation of modal proofs - Martini, Masini - 1994
31 Correctness of binding time analysis - Palsberg - 1993
30 Zeitschrift fur Mathematische Logik und Grundlagen der Mathe.. (context) - Kripke, of et al. - 1963
28 Compilers and staging transformations (context) - Jorring, Scherlis - 1986
27 Efficient multi-level generating extensions for program spec.. - Gluck, Jorgensen - 1995
24 Department of Computer Science and Engineering (context) - Keppel, Eggers et al. - 1993
21 a modal -calculus (context) - Pfenning, Wong - 1995
20 Type safe abstractions using program generators - Sheard, Nelson - 1995
14 Mechanically verifying the correctness of an offline partial.. - Hatcliff - 1995
4 Efficient algebraic operations on programs - Jones - 1991
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.cmu.edu/user/fp/www/homepage.html): More
Ordered Linear Logic Programming - Polakow, Pfenning (1998) (Correct)
Algorithms for Equality and Unification in the Presence of.. - Pfenning, Schürmann (1998) (Correct)
A Schema for Adding Dependent Types to ML - Xi, 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