A locally nameless solution to the POPLmark challenge - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2007

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.
Fichier principal
Vignette du fichier
RR-6098.pdf (405.37 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00123945 , version 1 (11-01-2007)
inria-00123945 , version 2 (11-01-2007)

Identifiers

  • HAL Id : inria-00123945 , version 2

Cite

Xavier Leroy. A locally nameless solution to the POPLmark challenge. [Research Report] RR-6098, INRIA. 2007, pp.54. ⟨inria-00123945v2⟩
242 View
289 Download

Share

Gmail Mastodon Facebook X LinkedIn More