The DOI matches its Crossref record.
Higher-order abstract syntax
Open accessAbstract
We describe motivation, design, use, and implementation of higher-order abstract syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and other formal systems where matching and substitution or unification are central operations. Higher-order abstract syntax incorporates name binding information in a uniform and language generic way. Thus it acts as a powerful link integrating diverse tools in such formal environments. We have implemented higher-order abstract syntax, a supporting matching and unification algorithm, and some clients in Common Lisp in the framework of the Ergo project at Carnegie Mellon University.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Uniform proofs as a foundation for logic programming
Miller, D., Nadathur, G., Pfenning, F., & Scedrov, A. (1991) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(91)90068-w · Cited by 571
Self-citationA Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
MILLER, D. (1991) · Journal of Logic and Computation · doi:10.1093/logcom/1.4.497 · Cited by 382
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
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
- Pfenning, F., & Elliott, C.
- Venue
- ACM SIGPLAN Notices
- Published
- 1988-06
- Volume
- 23
- Issue
- 7
- Pages
- 199-208
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2009464583
- Cited by
- 581
- References
- 0
- FWCI
- 11.60
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Higher-order abstract syntax. https://app.cochat.ai/papers/10.1145/960116.54010
- The paper
- Pfenning, F., & Elliott, C. (1988). Higher-order abstract syntax. ACM SIGPLAN Notices. https://doi.org/10.1145/960116.54010
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.