Reification by Parametricity: Fast Setup for Proof by Reflection, in Two Lines of Ltac
© 2018, Springer International Publishing AG, part of Springer Nature. We present a new strategy for performing reification in Coq. That is, we show how to generate first-class abstract syntax trees from "native" terms of Coq's logic, suitable as inputs to verified compilers or proced...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer International Publishing,
2021-11-04T19:19:42Z.
|
| Subjects: | |
| Online Access: | Get fulltext |