Distributed software built from components has become a mainstay of service-oriented
applications, which frequently undergo reconfigurations to adapt to changes in their …

Dedukti is a very expressive logical framework which unlike most frameworks, such as the
Edinburgh Logical Framework (LF), allows for the representation of computation alongside …

Interoperability between deductive program verification tools is a well-recognized long-
standing challenge. In this paper we propose a solution for a well-delineated aspect of this …

As the development of formal proofs is a time-consuming task, it is important to devise ways
of sharing the already written proofs to prevent wasting time redoing them. One of the …

We introduce CompLF, a logical framework allowing for the definition of computational type
theories--that is, those whose definitional equality is purely generated by rewrite rules. Its …

As the development of formal proofs is a time-consuming task, it is important to devise ways
of sharing the already written proofs to prevent wasting time redoing them. One of the …

Kuroda's translation embeds classical first-order logic into intuitionistic logic, through the
insertion of double negations. Recently, Brown and Rizkallah extended this translation to …

Parametricity allows the transfer of proofs between different implementations of the same
data structure. The lambdaPi-calculus modulo theory is an extension of the lambda-calculus …

Coinduction is a principle, or a proof technique, dual to induction and which allows to handle
possibly infinite objects in a natural way, such as infinite lists, infinite trees, formal …

Proof assistants such as Coq implement a type theory featuring three important features:
impredicativity, cumulativity and product covariance. This combination has proven difficult to …