Typechecking in the lambda-Pi-Calculus Modulo : Theory and Practice

Aims: This study aims to specify semantic cognition ’s involvement in the production and comprehension of derivational morphemes and morphologically complex words in SD

We prove that this encoding is correct and that encoded proofs can be mechanically checked by Dedukti , a type checker for the λΠ-calculus modulo theory using rewriting.. 2012

This means that in the considered model of lambda terms the radius of convergence of the generating function enumerating closed lambda terms is positive (even larger that 1/2), which

Cousineau and Dowek [6] introduced a general embedding of functional pure type systems (FPTS), a large class of typed λ-calculi, in the λΠ calculus modulo rewriting: for any FPTS

This encoding allows us, first, to properly define matching modulo β using the notion of higher order rewriting and, secondly, to make available, in the λ Π-calculus Modulo,

Our goal in this talk is twofold: first, we want to go further and show that other systems can be expressed in the λΠ-calculus modulo theory, in particular classical systems,

We have presented a version of the λΠ-calculus modulo where rewrite rules are explicitly added in contexts making their addition an iterative process where previous rules can be used