A list-machine benchmark for mechanized metatheory - Archive ouverte HAL Access content directly
Journal Articles Journal of Automated Reasoning Year : 2012

A list-machine benchmark for mechanized metatheory

(1) , (1) , (2)
1
2

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.
Fichier principal
Vignette du fichier
listmachine-journal.pdf (343.43 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00674176 , version 1 (25-02-2012)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More