A list-machine benchmark for mechanized metatheory - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2006

A list-machine benchmark for mechanized metatheory

(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
RR-5914.pdf (413.74 Ko) Télécharger le fichier

Dates and versions

inria-00077531 , version 1 (31-05-2006)

Identifiers

  • HAL Id : inria-00077531 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More