Type-directed partial evaluation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A compiled implementation of strong reduction
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Using Reflection to Build Efficient and Certified Decision Procedures
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
COLOG '88 Proceedings of the International Conference on Computer Logic
The Four Colour Theorem: Engineering of a Formal Proof
Computer Mathematics
A Compiled Implementation of Normalization by Evaluation
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Proof Pearl: Revisiting the Mini-rubik in Coq
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Proving equalities in a commutative ring done right in coq
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
On the role of type decorations in the calculus of inductive constructions
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Formalization of wu's simple method in coq
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Rigorous polynomial approximation using taylor models in Coq
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Towards a certified computation of homology groups for digital images
CTIC'12 Proceedings of the 4th international conference on Computational Topology in Image Context
Computing persistent homology within Coq/SSReflect
ACM Transactions on Computational Logic (TOCL)
The picard algorithm for ordinary differential equations in coq
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
Emerging trends in proof styles and new applications of interactive proof assistants exploit the computational facilities of the provided proof language, reaping enormous benefits in proof size and convenience to the user. However, the resulting proof objects really put the proof assistant to the test in terms of computational time required to check them. We present a novel translation of the terms of the full Calculus of (Co)Inductive Constructions to OCaml programs. Building on this translation, we further present a new fully featured version of Coq that offloads much of the computation required during proof checking to a vanilla, state of the art and fine tuned compiler. This modular scheme yields substantial performance improvements over existing systems at a reduced implementation cost. The work presented here builds on previous work described in [11], but we place particular emphasis in this paper on the fact that this scheme is in fact an instance of untyped normalization by evaluation [8, 14, 1,4].