Dedukti is a Logical Framework based on the λΠ-Calculus Modulo Theory. We show that many theories can be expressed in Dedukti: constructive and classical predicate logic, Simple type theory, programming languages, Pure type systems, the Calculus of inductive constructions with universes, etc. and that permits to used it to check large libraries of proofs developed in other proof systems: Zenon, iProver, FoCaLiZe, HOL Light, and Matita
International audienceThe λΠ-calculus modulo theory is a logical framework in which many logical sys...
K is a semantical framework for formally describing the semantics of programming languages thanks to...
International audienceWe present the certifying part of the Zenon Modulo automated theorem prover, w...
International audienceDefining a theory, such as arithmetic, geometry, or set theory, in predicate l...
International audienceDEDUKTI is a type-checker for the λ Π-calculus modulo theory, a logical framew...
The λΠ-calculus forms one of the vertices in Barendregt’s λ-cube and has been used as the core langu...
International audienceWe discuss the practical results obtained by the first generation of automated...
The general context Dedukti is an experimental language designed to write proof checkers for various...
We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Th...
International audienceDedukti has been proposed as a universal proof checker. It is a logical framew...
International audienceThe λΠ-calculus modulo theory is a logical framework in which many logical sys...
K is a semantical framework for formally describing the semantics of programming languages thanks to...
International audienceWe present the certifying part of the Zenon Modulo automated theorem prover, w...
International audienceDefining a theory, such as arithmetic, geometry, or set theory, in predicate l...
International audienceDEDUKTI is a type-checker for the λ Π-calculus modulo theory, a logical framew...
The λΠ-calculus forms one of the vertices in Barendregt’s λ-cube and has been used as the core langu...
International audienceWe discuss the practical results obtained by the first generation of automated...
The general context Dedukti is an experimental language designed to write proof checkers for various...
We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Th...
International audienceDedukti has been proposed as a universal proof checker. It is a logical framew...
International audienceThe λΠ-calculus modulo theory is a logical framework in which many logical sys...
K is a semantical framework for formally describing the semantics of programming languages thanks to...
International audienceWe present the certifying part of the Zenon Modulo automated theorem prover, w...