Models and termination of proof reduction in the λΠ-calculus modulo theory
Abstract
We define a notion of model for the λΠ-calculus modulo theory and prove a soundness theorem. We then define a notion of super-consistency and prove that proof reduction terminates in the λΠ-calculus modulo any super-consistent theory. We prove this way the termination of proof reduction in several theories including Simple type theory and the Calculus of constructions .
Origin | Files produced by the author(s) |
---|
Loading...