5 citations · 13 across the 5 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2023
Embedding Pure Type Systems in the lambda-Pi-calculus modulo
Denis Cousineau, Gilles Dowek
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu…
cs.LO2022★ 4 cited
Compositional pre-processing for automated reasoning in dependent type theory
Valentin Blot, Denis Cousineau, Enzo Crance +4
In the context of interactive theorem provers based on a dependent type theory, automation tactics (dedicated decision procedures, call of automated solvers, ...) are often limited…
cs.LO2012★ 4 cited
On completeness of reducibility candidates as a semantics of strong normalization
Denis Cousineau
This paper defines a sound and complete semantic criterion, based on reducibility candidates, for strong normalization of theories expressed in minimal deduction modulo à la Curry.…