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 :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00077531
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 31, 2006 - 10:03:05 AM
Last modification on : Friday, May 25, 2018 - 12:02:07 PM
Long-term archiving on : Monday, April 5, 2010 - 9:56:37 PM

Identifiers

  • HAL Id : inria-00077531, version 1

Collections

Citation

Andrew W. Appel, Xavier Leroy. A list-machine benchmark for mechanized metatheory. [Research Report] RR-5914, INRIA. 2006. ⟨inria-00077531⟩

Share

Metrics

Record views

403

Files downloads

350