The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Tutorial notes on partial evaluation
Open accessAbstract
The last years have witnessed a flurry of new results in the area of partial evaluation. These tutorial notes survey the field and present a critical assessment of the state of the art.
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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,453
Introduction to Metamathematics
Rasiowa, H. (1952) · Medical Entomology and Zoology · Cited by 4,307
Fast Pattern Matching in Strings
Knuth, D. E., Morris, Jr., & Pratt, V. R. (1977) · SIAM Journal on Computing · doi:10.1137/0206024 · Cited by 2,936
A fast string searching algorithm
Boyer, R. S., & Moore, J. S. (1977) · Communications of the ACM · doi:10.1145/359842.359859 · Cited by 2,290
Linear pattern matching algorithms
Weiner, P. (1973) · 14th Annual Symposium on Switching and Automata Theory (swat 1973) · doi:10.1109/swat.1973.13 · Cited by 1,801
Partial evaluation and automatic program generation
Jones, N. D., Gomard, C. K., & Sestoft, P. (1993) · Medical Entomology and Zoology · Cited by 1,440
A Transformation System for Developing Recursive Programs
Burstall, R. M., & Darlington, J. (1977) · Journal of the ACM · doi:10.1145/321992.321996 · Cited by 1,300
Appel, A. W. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511609619 · Cited by 824
Essentials of programming languages
(2008) · Choice Reviews Online · doi:10.5860/choice.46-1527 · Cited by 316
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
An experiment in partial evaluation: The generation of a compiler generator
Jones, N. D., Sestoft, P., & Søndergaard, H. (1985) · Lecture Notes in Computer Science · doi:10.1007/3-540-15976-2_6 · Cited by 219
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
Pu, C., Massalin, H., & Ioannidis, J. (1987) · Columbia Academic Commons (Columbia University) · doi:10.7916/d8t15bpt · Cited by 134
Improving binding times without explicit CPS-conversion
Bondorf, A. (1992) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/141471.141483 · Cited by 111
A partial evaluator, and its use as a programming tool
Beckman, L., Haraldson, A., Oskarsson, Ö., & Sandewall, E. J. (1976) · Artificial Intelligence · doi:10.1016/0004-3702(76)90011-4 · Cited by 107
Partial evaluation as a means for inferencing data structures in an applicative language
Komorowski, J. (1982) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/582153.582181 · Cited by 102
Partial evaluation of pattern matching in strings
Consel, C., & Olivier Danvy, A. (1989) · Information Processing Letters · doi:10.1016/0020-0190(89)90113-0 · Cited by 92
Self-citationBinding time analysis for high order untyped functional languages
Consel, C. (1990) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/91556.91668 · Cited by 84
Self-citationPolyvariant mixed computation for analyzer programs
Bulyonkov, M. A. (1984) · Acta Informatica · doi:10.1007/bf00271642 · Cited by 76
Automatic online partial evaluation
Weise, D., Conybeare, R., Ruf, E., & Seligman, S. (1991) · Lecture notes in computer science · doi:10.1007/3540543961_9 · Cited by 72
Partial type inference for untyped functional programs
Gomard, C. K. (1990) · doi:10.1145/91556.91672 · Cited by 59
Specialisation of Prolog and FCP programs using abstract interpretation
Gallagher, J. P., Codish, M., & Shapiro, E. Y. (1988) · New Generation Computing · doi:10.1007/bf03037136 · Cited by 57
Parameterized partial evaluation
Consel, C., & Khoo, S. (1993) · ACM Transactions on Programming Languages and Systems · doi:10.1145/169683.174155 · Cited by 48
Self-citationPartial evaluation of pattern matching in constraint logic programming languages
Smith, D. A. (1991) · doi:10.1145/115865.115873 · Cited by 42
A program manipulation system based on partial evaluation
Haraldsson, A. (1977) · DiVA (Linkoping University) · Cited by 37
Towards multiple self-application
Glück, R. (1991) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/115865.115900 · Cited by 24
Using types to avoid redundant specialization
Ruf, E., & Weise, D. (1991) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/115865.115902 · Cited by 23
Semantics-directed generation of a Prolog compiler
Consel, C., & Khoo, S. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54444-5_94 · Cited by 17
Self-citationProMiX: a Prolog partial evaluation system
Lakhotia, A., & STERLING, L. S. (1990) · Cited by 14
Cited by
Multi-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
Locus Solum: From the rules of logic to the logic of rules
GIRARD, J.-Y. (2001) · Mathematical Structures in Computer Science · doi:10.1017/s096012950100336x · Cited by 267
Tutorial on specialisation of logic programs
Gallagher, J. P. (1993) · Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '93 · doi:10.1145/154630.154640 · Cited by 171
Controlling generalization and polyvariance in partial deduction of normal logic programs
Leuschel, M., Martens, B., & De Schreye, D. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271525 · Cited by 88
Ensuring Global Termination of Partial Deduction While Allowing Flexible Polyvariance
Martens, B., & Gallagher, J. (1995) · Logic Programming · doi:10.7551/mitpress/4298.003.0059 · Cited by 69
Metadata
- Authors
- Consel, C., & Danvy, O.
- Venue
- Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93
- Publisher
- ACM Press
- Published
- 1993
- Pages
- 493-501
- OpenAlex
- W2058958439
- Cited by
- 316
- References
- 30
- FWCI
- 22.85
- Type
- conference paper
- 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.