Towards the Integration of an Intuitionistic First-Order Prover into Coq
arXiv:1606.05948 · doi:10.4204/EPTCS.210.6
Abstract
An efficient intuitionistic first-order prover integrated into Coq is useful to replay proofs found by external automated theorem provers. We propose a two-phase approach: An intuitionistic prover generates a certificate based on the matrix characterization of intuitionistic first-order logic; the certificate is then translated into a sequent-style proof.
In Proceedings HaTT 2016, arXiv:1606.05427