A locally nameless solution to the POPLmark challenge

Abstract : The POPLmark challenge is a collective experiment intended to assess the usability of theorem provers and proof assistants in the context of fundamental research on programming languages. In this report, we present a solution to the challenge, developed with the Coq proof assistant, and using the "locally nameless" presentation of terms with binders introduced by McKinna, Pollack, Gordon, and McBride.
Complete list of metadatas

https://hal.inria.fr/inria-00123945
Contributor : Xavier Leroy <>
Submitted on : Thursday, January 11, 2007 - 3:47:32 PM
Last modification on : Friday, May 25, 2018 - 12:02:07 PM
Long-term archiving on : Tuesday, April 6, 2010 - 7:51:06 PM

Files

report.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00123945, version 1

Citation

Xavier Leroy. A locally nameless solution to the POPLmark challenge. [Research Report] 2007, pp.54. ⟨inria-00123945v1⟩

Share

Metrics

Record views

13

Files downloads

104