Computational Reflection in the Calculus of Constructions and its Application to Theorem Proving

Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a technique, issued from automated theorem proving, is of general interest because it permits one to separate ...

This paper presents a theorem prover for a combination of constructive first-order logic and the λ-calculus. The paper presents the basic theorem prover, which is an extension of [6]'s model generation theorem prover for first-order logic, and considers ...