Shallow binding makes functional arrays fast
ACM SIGPLAN Notices
Purely functional data structures
Purely functional data structures
A compiled implementation of strong reduction
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Single-Threaded Objects in ACL2
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Static Analysis for Safe Destructive Updates in a Functional Language
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Monads for Functional Programming
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
A persistent union-find data structure
ML '07 Proceedings of the 2007 workshop on Workshop on ML
Decision Procedures: An Algorithmic Point of View
Decision Procedures: An Algorithmic Point of View
Imperative Functional Programming with Isabelle/HOL
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
A Hoare Logic for the State Monad
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions
Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions
On the role of type decorations in the calculus of inductive constructions
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Computer certified efficient exact reals in Coq
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Self-certification: bootstrapping certified typecheckers in F* with Coq
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A modular integration of SAT/SMT solvers to coq through proof witnesses
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Modular SMT proofs for fast reflexive checking inside coq
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
versat: a verified modern SAT solver
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Generating Invariant-Based Certificates for Embedded Systems
ACM Transactions on Embedded Computing Systems (TECS)
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)
Lightweight proof by reflection using a posteriori simulation of effectful computation
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Implementing hash-consed structures in coq
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
A Framework for the Verification of Certifying Computations
Journal of Automated Reasoning
| Hi-index | 0.00 |
Coq has within its logic a programming language that can be used to replace many deduction steps into a single computation, this is the so-called reflection. In this paper, we present two extensions of the evaluation mechanism that preserve its correctness and make it possible to deal with cpu-intensive tasks such as proof checking of SAT traces.