As the development of formal proofs is a time-consuming task, it is impo...
As the development of formal proofs is a time-consuming task, it is impo...
The lambda-Pi-calculus modulo theory is a logical framework in which man...
The λΠ-calculus modulo theory is a logical framework in which
various lo...
Dedukti is a type-checker for the λΠ-calculus modulo rewriting,
an exten...
The expressiveness of dependent type theory can be extended by identifyi...
Proof assistants often call automated theorem provers to prove subgoals....
Dependency pairs are a key concept at the core of modern automated
termi...
The Size-Change Termination principle was first introduced to study the
...
This volume contains a selection of papers presented at LFMTP 2018, the ...
Arts and Giesl proved that the termination of a first-order rewrite syst...
We provide a general and modular criterion for the termination of
simply...