Skip to content

Latest commit

 

History

History
38 lines (29 loc) · 1.28 KB

README.md

File metadata and controls

38 lines (29 loc) · 1.28 KB
Raw

MicroProver in Coq

This is a small automated theorem prover for the fragment of propositional logic consisting of implications and falsity. The soundness and completeness of the prover has been formally verified in Coq.

The propositional symbols are named by integers.

The prover is implemented in Coq, with a command line interface in Haskell.

Build instructions

You need Coq 8.15, Coq Equations 1.3+8.15, Haskell, and Cabal.

Before running the Haskell compiler, we need to compile the Coq code which will generate a Haskell file. This can be done by running:

coqc MicroProver.v

We can then compile the command line application by running:

cabal build MicroProver

The application can then be found somewhere in the dist-newstyle folder.

The application can be run through Cabal by running e.g.:

cabal run MicroProver -- "Imp (Pro 0) (Pro 0)"

The formulas consist of the constructors Imp, False, and Pro n where n is some integer. Parentheses are needed around each subformula for ambiguation.

There is also a small test suite which can be run by running:

cabal test

Acknowledgements

This project is based on the microprovers in Isabelle and Agda by Jørgen Villadsen and Asta Halkjær From.