• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

A Modal Analysis of Staged Computation (1996)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [reports-archive.adm.cs.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.lb.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.daimi.aau.dk]
  • [reports.adm.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Rowan Davies , Frank Pfenning
Venue:JOURNAL OF THE ACM
Citations:166 - 21 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Davies96amodal,
    author = {Rowan Davies and Frank Pfenning},
    title = {A Modal Analysis of Staged Computation},
    booktitle = {JOURNAL OF THE ACM},
    year = {1996},
    pages = {258--270},
    publisher = {ACM Press}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

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, which in

Citations

593 Partial Evaluation and Automatic Program Generation - Jones, Gomard, et al. - 1993
541 Linear Logic - Girard - 1987
290 Logic programming with focusing proofs in linear logic - Andreoli - 1992
179 A General Approach for Run-Time Specialization and its Application to C - Consel, Noel - 1996
172 Logic programming in the LF logical framework - Pfenning - 1991
151 Refinement types for ML - Freeman, Pfenning - 1991
148 Optimizing ML with Run-Time Code Generation - Lee, Leone - 1996
117 On the meanings of the logical constants and the justifications of the logical laws - Martin-Löf - 1996
97 C: A Language for High-Level, Efficient, and Machine-Independent Dynamic Code Generation - Engler, Hsieh, et al. - 1996
90 A simple applicative language: Mini-ml - Clément, Despeyroux, et al. - 1986
90 A partial evaluator for the untyped lambda-calculus - Gomard, Jones - 1991
86 Efficient type inference for higher-order binding-time analysis - Henglein - 1991
77 A temporal-logic approach to binding-time analysis - Davies - 1996
57 A case for runtime code generation - Keppel, Eggers, et al. - 1991
54 Efficient multi-level generating extensions for program specialization - Glück, Jørgensen - 1995
53 Propositional lax logic - Fairtlough, Mendler - 1997
52 Lightweight run-time code generation - Leone, Lee - 1994
51 Computational types from a logical perspective - Benton, Bierman, et al. - 1998
47 Semantical analysis of modal logic I, normal propositional calculi. Zeitschrift für mathematische Logik und Grundlagen der - Kripke - 1963
44 and Hanne Riis Nielson. Two-Level Functional Languages, volume 34 of Cambridge Tracts - Nielson - 1992
42 Partial evaluation of Standard ML - Birkedal, Welinder - 1993
28 A computational interpretation of modal proofs - Martini, Masini - 1996
19 Truth of a proposition, evidence of a judgement, validity of a proof, Workshop on the theories of meaning - Martin-Lof - 1985
18 and Valeria de Paiva, Intuitionistic necessity revisited, Logic at Work - Bierman - 1992
14 Coming to Terms with Modal Logic: On the interpretation of modalities in typed λ–calculus - Borghuis - 1994
14 Compilers and staging transformations - Jrring, Scherlis - 1986
12 On a modal -calculus for S4 - Pfenning, Wong - 1995
12 Mechanically verifying the correctness of an offline partial evaluator - Hatcliff - 1995
11 Deferred compilation: The automation of run-time code generation - Leone, Lee - 1994
11 Monad as modality - Kobayashi - 1997
8 On computational interpretations of the modal logic S4 I. Cut elimination, Interner Bericht 1996-35 - Goubault-Larrecq - 1996
8 On computational interpretations of the modal logic S4 III. Termination, confluence, conservativity of evQ and evQ H - Goubault-Larrecq - 1996
6 Efficient multi-level generating extensions - Gluck, J��rgensen - 1995
6 On computational interpretations of the modal logic S4 II. The evQ-calculus - Goubault-Larrecq - 1996
5 Efficient algebraic operations on programs - Jones - 1991
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University