The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Mechanized Metatheory for the Masses: The PoplMark Challenge
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
Milner, R., Harper, R., MacQueen, D., & Tofte, M. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/2319.001.0001 · Cited by 2,419
Types and Programming Languages
Pierce, B. C. (2002) · Cited by 2,226
Self-citationOn understanding types, data abstraction, and polymorphism
Cardelli, L., & Wegner, P. (1985) · ACM Computing Surveys · doi:10.1145/6041.6042 · Cited by 1,669
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45949-9 · Cited by 1,629
Introduction to HOL: a theorem proving environment for higher order logic
Gordon, M., & Melham, T. (1993) · Cambridge University Press eBooks · Cited by 1,299
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 1,279
A Syntactic Approach to Type Soundness
Wright, A. K., & Felleisen, M. (1994) · Information and Computation · doi:10.1006/inco.1994.1093 · Cited by 1,136
Assigning Meanings to Programs
Floyd, R. W. (1993) · Studies in Cognitive Systems · doi:10.1007/978-94-011-1793-7_4 · Cited by 1,079
de Bruijn, N. G. (1972) · Indagationes Mathematicae (Proceedings) · doi:10.1016/1385-7258(72)90034-0 · Cited by 1,049
The Definition of Standard ML (Revised)
Milner, R., Harper, R. W., MacQueen, D. B., & Tofte, M. (1997) · Cited by 985
Computer-Aided Reasoning: An Approach
Kaufmann, M., Moore, J. S., & Manolios, P. (2011) · Cited by 608
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
Pfenning, F., & Elliott, C. (1988) · ACM SIGPLAN Notices · doi:10.1145/960116.54010 · Cited by 581
Hodes, H., & Barendregt, H. P. (1988) · The Philosophical Review · doi:10.2307/2185110 · Cited by 564
HOL Light: A tutorial introduction
Harrison, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0031814 · Cited by 335
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
The verifying compiler: A grand challenge for computing research
Hoare, T. (2003) · Journal of the ACM · doi:10.1145/602382.602403 · Cited by 261
A machine-checked model for a Java-like language, virtual machine, and compiler
Klein, G., & Nipkow, T. (2006) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1146809.1146811 · Cited by 246
Some Lambda Calculus and Type Theory Formalized
McKinna, J., & Pollack, R. (1999) · Journal of Automated Reasoning · doi:10.1023/a:1006294005493 · Cited by 108
Toward a foundational typed assembly language
Crary, K. (2003) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/604131.604149 · Cited by 93
Type Inference Verified: Algorithm W in Isabelle/HOL
Naraschewski, W., & Nipkow, T. (1999) · Journal of Automated Reasoning · doi:10.1023/a:1006277616879 · Cited by 38
Metadata
- Authors
- Aydemir, B. E., Bohannon, A., Fairbairn, M., Foster, J. N., Pierce, B. C., Sewell, P., Vytiniotis, D., Washburn, G., Weirich, S., & Zdancewic, S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 50-65
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2095631859
- Cited by
- 303
- References
- 21
- FWCI
- 21.46
- Type
- conference paper
- 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
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.