The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
An indexed model of recursive types for foundational proof-carrying code
Abstract
The proofs of "traditional" proof carrying code (PCC) are type-specialized in the sense that they require axioms about a specific type system. In contrast, the proofs of foundational PCC explicitly define all required types and explicitly prove all the required properties of those types assuming only a fixed foundation of mathematics such as higher-order logic. Foundational PCC is both more flexible and more secure than type-specialized PCC.For foundational PCC we need semantic models of type systems on von Neumann machines. Previous models have been either too weak (lacking general recursive types and first-class function-pointers), too complex (requiring machine-checkable proofs of large bodies of computability theory), or not obviously applicable to von Neumann machines. Our new model is strong, simple, and works either in λ-calculus or on Pentiums.
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
Cites
Necula, G. C. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263712 · Cited by 1,843
A framework for defining logics
Harper, R., Honsell, F., & Plotkin, G. (1993) · Journal of the ACM · doi:10.1145/138027.138060 · Cited by 990
Implementing Mathematics with The Nuprl Proof Development System
Constable, R. L., Allen, S. F., Bromley, H. M., Cleaveland, W. R., Cremer, J. F., Harper, R. W., Howe, D. J., Knoblock, T. B., Mendler, N. P., Panangaden, P., et al. (1986) · Cited by 985
Scott, D. (2006) · Springer eBooks · doi:10.1007/bfb0079432 · Cited by 737
System Description: Twelf — A Meta-Logical Framework for Deductive Systems
Pfenning, F., & Schürmann, C. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48660-7_14 · Cited by 595
(2007) · Undergraduate topics in computer science · doi:10.1007/978-1-84628-692-6_5 · Cited by 367
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268954 · Cited by 282
A certifying compiler for Java
Colby, C., Lee, P., Necula, G. C., Blau, F., Plesko, M., & Cline, K. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349315 · Cited by 183
Necula, G. C., & Lee, P. (1998) · Cited by 174
A semantic model of types and machine instructions for proof-carrying code
Appel, A. W., & Felty, A. P. (2000) · Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/325694.325727 · Cited by 159
Self-citation
Cited by
RustBelt: securing the foundations of the Rust programming language
Jung, R., Jourdan, J.-H., Krebbers, R., & Dreyer, D. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158154 · Cited by 368
Foundational proof-carrying code
Appel, A. W. (2002) · Proceedings 16th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.2001.932501 · Cited by 308
Self-citationTimany, A., Stefanesco, L., Krogh-Jespersen, M., & Birkedal, L. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158152 · Cited by 51
Binders by day, labels by night: effect instances via lexically scoped handlers
Biernacki, D., Piróg, M., Polesiuk, P., & Sieczkowski, F. (2020) · Proceedings of the ACM on Programming Languages · doi:10.1145/3371116 · Cited by 46
Handle with care: relational interpretation of algebraic effects and handlers
Biernacki, D., Piróg, M., Polesiuk, P., & Sieczkowski, F. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158096 · Cited by 45
Metadata
- Authors
- Appel, A. W., & McAllester, D.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 2001-09
- Volume
- 23
- Issue
- 5
- Pages
- 657-683
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W1991984504
- Cited by
- 348
- References
- 14
- FWCI
- 8.64
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An indexed model of recursive types for foundational proof-carrying code. https://app.cochat.ai/papers/10.1145/504709.504712
- The paper
- Appel, A. W., & McAllester, D. (2001). An indexed model of recursive types for foundational proof-carrying code. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/504709.504712
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.