The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
Open accessAbstract
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, generalized algebraic data types, or postprocessing to eliminate tags. The statically type-preserving interpretations include an evaluator, a compiler (or staged evaluator), a partial evaluator, and call-by-name and call-by-value continuation-passing style (CPS) transformers. Our principal technique is to encode de Bruijn or higher-order abstract syntax using combinator functions rather than data constructors. In other words, we represent object terms not in an initial algebra but using the coalgebraic structure of the λ-calculus. Our representation also simulates inductive maps from types to types, which are required for typed partial evaluation and CPS transformations. Our encoding of an object term abstracts uniformly over the family of ways to interpret it, yet statically assures that the interpreters never get stuck. This family of interpreters thus demonstrates again that it is useful to abstract over higher-kinded types.
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
A theory of type polymorphism in programming
Milner, R. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90014-4 · Cited by 2,205
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
Call-by-name, call-by-value and the λ-calculus
Plotkin, G. D. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90017-1 · Cited by 1,154
LCF considered as a programming language
Plotkin, G. D. (1977) · Theoretical Computer Science · doi:10.1016/0304-3975(77)90044-5 · Cited by 1,083
Definitional interpreters for higher-order programming languages
Reynolds, J. C. (1972) · Proceedings of the ACM annual conference on - ACM '72 · doi:10.1145/800194.805852 · Cited by 669
The next 700 programming languages
Landin, P. J. (1966) · Communications of the ACM · doi:10.1145/365230.365257 · Cited by 661
Pfenning, F., & Elliott, C. (1988) · ACM SIGPLAN Notices · doi:10.1145/960116.54010 · Cited by 581
Template meta-programming for Haskell
Sheard, T., & Jones, S. P. (2002) · Proceedings of the 2002 ACM SIGPLAN workshop on Haskell · doi:10.1145/581690.581691 · Cited by 545
Building domain-specific embedded languages
Hudak, P. (1996) · ACM Computing Surveys · doi:10.1145/242224.242477 · Cited by 477
The principle type-scheme of an object in combinatory logic
Hindley, R. (1969) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1969-0253905-6 · Cited by 448
Bjesse, P., Claessen, K., Sheeran, M., & Singh, S. (1998) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/289423.289440 · Cited by 377
Representing Control: a Study of the CPS Transformation
Danvy, O., & Filinski, A. (1992) · Mathematical Structures in Computer Science · doi:10.1017/s0960129500001535 · Cited by 352
Partial Evaluation of Computation Process--An Approach to a Compiler-Compiler
Futamura, Y. (1999) · LISP and Symbolic Computation · doi:10.1023/a:1010095604496 · Cited by 349
Simple unification-based type inference for GADTs
Peyton Jones, S., Vytiniotis, D., Weirich, S., & Washburn, G. (2006) · Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming · doi:10.1145/1159803.1159811 · Cited by 335
Aerts, K., & Schmidt, T. (2008) · Research Policy · doi:10.1016/j.respol.2008.01.011 · Cited by 327
Guarded 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
The Principal Type-Scheme of an Object in Combinatory Logic
Hindley, R. (1969) · Transactions of the American Mathematical Society · doi:10.2307/1995158 · Cited by 319
Compiling polymorphism using intensional type analysis
Harper, R., & Morrisett, G. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199475 · Cited by 295
A modal analysis of staged computation
Davies, R., & Pfenning, F. (2001) · Journal of the ACM · doi:10.1145/382780.382785 · Cited by 293
Nanevski, A., Pfenning, F., & Pientka, B. (2008) · ACM Transactions on Computational Logic · doi:10.1145/1352582.1352591 · Cited by 258
Mix: A self-applicable partial evaluator for experiments in compiler generation
Jones, N. D., Sestoft, P., & Søndergaard, H. (1989) · Lisp and Symbolic Computation · doi:10.1007/bf01806312 · Cited by 250
Filinski, A. (1994) · Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94 · doi:10.1145/174675.178047 · Cited by 248
A call-by-need lambda calculus
Ariola, Z. M., Maraist, J., Odersky, M., Felleisen, M., & Wadler, P. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199507 · Cited by 246
Abstract interpretation: a semantics-based tool for program analysis
Jones, N. D., & Nielson, F. (1995) · Oxford University Press eBooks · doi:10.1093/oso/9780198537809.003.0005 · Cited by 176
Type-directed partial evaluation
Danvy, O. (1996) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/237721.237784 · Cited by 170
Automatic autoprojection of recursive equations with global variables and abstract data types
Bondorf, A., & Olivier Danvy, A. (1991) · Science of Computer Programming · doi:10.1016/0167-6423(91)90002-f · Cited by 154
On the Relation between Direct and Continuation Semantics
Reynolds, J. C. (1974) · Lecture notes in computer science · doi:10.1007/3-540-06841-4_57 · Cited by 136
A Logic Programming Approach To Manipulating Formulas And Programs
Miller, D., & Nadathur, G. (1987) · Cited by 104
Consel, C. (1993) · doi:10.1145/154630.154645 · Cited by 104
Baars, A. I., & Swierstra, S. D. (2002) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/581478.581494 · Cited by 102
Meta-programming with names and necessity
Nanevski, A. (2002) · ACM SIGPLAN Notices · doi:10.1145/583852.581498 · Cited by 75
Staged computation with names and necessity
Nanevski, A., & Pfenning, F. (2005) · Journal of Functional Programming · doi:10.1017/s095679680500568x · Cited by 57
Challenging problems in partial evaluation and mixed computation
Jones, N. D. (1988) · New Generation Computing · doi:10.1007/bf03037143 · Cited by 50
Benton, N. (2005) · Journal of Functional Programming · doi:10.1017/s0956796804005398 · Cited by 46
A type system for certified binaries
Shao, Z., Trifonov, V., Saha, B., & Papaspyrou, N. (2005) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1053468.1053469 · Cited by 44
Multi-stage Programming with Functors and Monads: Eliminating Abstraction Overhead from Generic Code
Carette, J., & Kiselyov, O. (2005) · Lecture notes in computer science · doi:10.1007/11561347_18 · Cited by 38
Self-citationSelf-applicable online partial evaluation
Sperber, M. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61580-6_23 · Cited by 16
Cited by
Lightweight modular staging: a pragmatic approach to runtime code generation and compiled DSLs
Rompf, T., & Odersky, M. (2010) · Proceedings of the ninth international conference on Generative programming and component engineering · doi:10.1145/1868294.1868314 · Cited by 277
Embedding a full linear Lambda calculus in Haskell
Polakow, J. (2015) · Proceedings of the 2015 ACM SIGPLAN Symposium on Haskell · doi:10.1145/2804302.2804309 · Cited by 17
Metadata
- Authors
- CARETTE, J., KISELYOV, O., & SHAN, C.-C.
- Venue
- Journal of Functional Programming
- Publisher
- Cambridge University Press (CUP)
- Published
- 2009-04-15
- Volume
- 19
- Issue
- 5
- Pages
- 509-543
- ISSN
- 0956-7968 (ISSN-L)
- 1469-7653
- OpenAlex
- W2123092976
- Cited by
- 279
- References
- 38
- FWCI
- 20.96
- Type
- journal article
- Language
- en
- Open access
- bronze
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.