Nested Abstract Syntax in Coq - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Automated Reasoning Année : 2012

Nested Abstract Syntax in Coq

Résumé

We illustrate Nested Abstract Syntax as a high-level alternative representation of langages with binding constructs, based on nested datatypes. Our running example is a partial solution in the Coq proof assistant to the POPLmark Challenge. The resulting formalization is very compact and does not require any extra library or special logical apparatus. Along the way, we propose an original, high-level perspective on environments.
Fichier principal
Vignette du fichier
math-nestedAS(1).pdf (202.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01294214 , version 1 (30-03-2016)

Identifiants

Citer

André Hirschowitz, Marco Maggesi. Nested Abstract Syntax in Coq. Journal of Automated Reasoning, 2012, 49 (3), pp.409-429. ⟨10.1007/s10817-010-9207-9⟩. ⟨hal-01294214⟩
80 Consultations
143 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More