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,448
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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Tutorial notes on partial evaluation. https://app.cochat.ai/papers/10.1145/158511.158707
- The paper
- Consel, C., & Danvy, O. (1993). Tutorial notes on partial evaluation. Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93. https://doi.org/10.1145/158511.158707
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.