Skip to Main content Skip to Navigation
Journal articles

A list-machine benchmark for mechanized metatheory

Abstract : We propose a benchmark to compare theorem-proving systems on their ability to express proofs of compiler correctness. In contrast to the first POPLmark, we emphasize the connection of proofs to compiler implementations, and we point out that much can be done without binders or alpha-conversion. We propose specific criteria for evaluating the utility of mechanized metatheory systems; we have constructed solutions in both Coq and Twelf metatheory, and we draw conclusions about those two systems in particular.
Document type :
Journal articles
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Xavier Leroy Connect in order to contact the contributor
Submitted on : Saturday, February 25, 2012 - 7:30:22 PM
Last modification on : Friday, January 21, 2022 - 3:16:05 AM
Long-term archiving on: : Friday, November 23, 2012 - 2:50:23 PM


Files produced by the author(s)




Andrew Appel, Robert Dockins, Xavier Leroy. A list-machine benchmark for mechanized metatheory. Journal of Automated Reasoning, Springer Verlag, 2012, 49 (3), pp.453--491. ⟨10.1007/s10817-011-9226-1⟩. ⟨hal-00674176⟩



Les métriques sont temporairement indisponibles