Compositional Computational Reflection
Name
Chlipala_Compositional.pdf
Size
332.05 KB
Format
Adobe PDF
Checksum (MD5)
a7d2d35ac919169beea9a4e57d15233f
Author(s)
Malecha, Gregory
Chlipala, Adam
Braibant, Thomas
Date Issued
2014
Journal
Interactive Theorem Proving
Publisher
Springer-Verlag
Citation
Malecha, Gregory, Adam Chlipala, and Thomas Braibant. “Compositional Computational Reflection.” Lecture Notes in Computer Science (2014): 374–389.
Version
Author's final manuscript
Abstract
Current work on computational reflection is single-minded; each reflective procedure is written with a specific application or scope in mind. Composition of these reflective procedures is done by a proof- generating tactic language such as Ltac. This composition, however, comes at the cost of both larger proof terms and redundant preprocessing. In this work, we propose a methodology for writing composable reflective procedures that solve many small tasks in a single invocation. The key technical insights are techniques for reasoning semantically about extensible syntax in intensional type theory. Our techniques make it possible to compose sound procedures and write generic procedures parametrized by lemmas mimicking Coq’s support for hint databases.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-319-08970-6_24
