The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
A modal analysis of staged computation
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 λ-calculi and functional languages. We directly demonstrate the sense in which our λ e →□ -calculus captures staging, and also give a conservative embeddng of Nielson and Nielson's two-level functional language in our functional language Mini-ML □ , thus proving that binding-time correctness is equivalent to modal correctness on this fragment. In addition, Mini-ML □ can also express immediate evaluation and sharing of code across multiple stages, thus supporting run-time code generation as well as partial evaluation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Chellas, B. F. (1980) · Cited by 1,806
Notions of computation and monads
Moggi, E. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90052-4 · Cited by 1,688
Partial evaluation and automatic program generation
Jones, N. D., Gomard, C. K., & Sestoft, P. (1993) · Medical Entomology and Zoology · Cited by 1,440
Chellas, B. F. (1980) · Cambridge University Press eBooks · doi:10.1017/cbo9780511621192 · Cited by 1,422
Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
Kripke, S. A. (1963) · Mathematical Logic Quarterly · doi:10.1002/malq.19630090502 · Cited by 1,287
Computational lambda-calculus and monads
Moggi, E. (2003) · [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science · doi:10.1109/lics.1989.39155 · Cited by 842
Cambridge University Press, 1696-1712
McKenzie, D. F. (2016) · Cambridge University Press eBooks · doi:10.1017/cbo9780511695612.014 · Cited by 813
Logic Programming with Focusing Proofs in Linear Logic
Andreoli, J. (1992) · Journal of Logic and Computation · doi:10.1093/logcom/2.3.297 · Cited by 656
Reflection and semantics in LISP
Smith, B. C. (1984) · Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '84 · doi:10.1145/800017.800513 · Cited by 444
A judgmental reconstruction of modal logic
PFENNING, F., & DAVIES, R. (2001) · Mathematical Structures in Computer Science · doi:10.1017/s0960129501003322 · Cited by 342
Self-citationMulti-stage programming with explicit annotations
Taha, W., & Sheard, T. (1997) · Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation · doi:10.1145/258993.259019 · Cited by 342
Logic programming in the LF logical framework
Pfenning, F. (1991) · Logical Frameworks · doi:10.1017/cbo9780511569807.008 · Cited by 211
Self-citationGirard, J.-Y. (1993) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(93)90093-s · Cited by 197
C: a language for high-level, efficient, and machine-independent dynamic code generation
Engler, D., Hsieh, W. C.-Y., & Kaashoek, M. F. (1996) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/237721.237765 · Cited by 168
A simple applicative language: mini-ML
Clément, D., Despeyroux, T., Kahn, G., & Despeyroux, J. (1986) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/319838.319847 · Cited by 159
Compilers and staging transformations
Jorring, U., & Scherlis, W. L. (1986) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/512644.512652 · Cited by 151
A modal analysis of staged computation
Davies, R., & Pfenning, F. (1996) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/237721.237788 · Cited by 143
Self-citationComputational types from a logical perspective
BENTON, P. N., BIERMAN, G. M., & DE PAIVA, V. C. V. (1998) · Journal of Functional Programming · doi:10.1017/s0956796898002998 · Cited by 110
Efficient multi-level generating extensions for program specialization
Glück, R., & Jørgensen, J. (1995) · Lecture notes in computer science · doi:10.1007/bfb0026825 · Cited by 103
Wadler, P. L. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57182-5_12 · Cited by 85
Cited by
A judgmental reconstruction of modal logic
PFENNING, F., & DAVIES, R. (2001) · Mathematical Structures in Computer Science · doi:10.1017/s0960129501003322 · Cited by 342
Self-citationGuarded recursive datatype constructors
Xi, H., Chen, C., & Chen, G. (2003) · Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/604131.604150 · Cited by 325
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
CARETTE, J., KISELYOV, O., & SHAN, C.-C. (2009) · Journal of Functional Programming · doi:10.1017/s0956796809007205 · Cited by 279
Nanevski, A., Pfenning, F., & Pientka, B. (2008) · ACM Transactions on Computational Logic · doi:10.1145/1352582.1352591 · Cited by 258
Self-citation
Metadata
- Authors
- Davies, R., & Pfenning, F.
- Venue
- Journal of the ACM
- Published
- 2001-05
- Volume
- 48
- Issue
- 3
- Pages
- 555-604
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2029408547
- Cited by
- 293
- References
- 22
- FWCI
- 13.52
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.