Contribution: ReflexiveFirstOrder
Reflexive first-order proof interpreter
Authors
- Pierre Corbineau
Description
This contribution is a package which can be used to interpret firstorder proofs provided by an external theorem prover, using computationnal reflexion.
Keywords
computationnal reflection, interpretation, first order logic, equational reasoning
README
This package should contain the following files : README : this file LGPL : a copy of the GNU library general public license .depend : a dependency file used by the Makefile howto-cime : A quick help to use the present library with cime traces Makefile Bintree.v : Definition of binary trees and generic lemmata about lists Env.v : Definition of domain encoding and dependant pairs used in environments, and of the Instanceof relation. Term_algebra.v : Signature for terme algebras. Free_algebra.v : Instance of Term_algebra.Algebra, basic terms. Dummy_algebra.v: Instance of Term_algebra.Algebra, no terms (for propositional logic). Form.v : Definition and properties of formulae. Sequent.v : Definitions and properties of sequents, meta theorems. Proof.v : Definition of proof traces and reflexion principle. Main.v : Wrapper. Example.v : example file
Available files
- ReflexiveFirstOrder.Dummy_algebra.html
- ReflexiveFirstOrder.Bintree.html
- ReflexiveFirstOrder.Free_algebra.html
- ReflexiveFirstOrder.Sequent.html
- ReflexiveFirstOrder.Proof.html
- ReflexiveFirstOrder.Env.html
- ReflexiveFirstOrder.Example.html
- ReflexiveFirstOrder.Term_algebra.html
- ReflexiveFirstOrder.Form.html
- ReflexiveFirstOrder.Main.html
