The λΠ-calculus modulo theory is a logical framework in which many logical systems can be
expressed as theories. We present such a theory, the theory $\mathcal {U} $, where proofs of …

The λΠ-calculus modulo theory is a logical framework in which many type systems can be
expressed as theories. We present such a theory, the theory U, where proofs of several …

Dedukti is a type-checker for the $\lambda $$\Pi $-calculus modulo rewriting, an extension
of Edinburgh's logicalframework LF where functions and type symbols can be defined by …

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 …

The interoperability of proof assistants and the integration of their libraries is a highly valued
but elusive goal in the field of theorem proving. As a preparatory step, in previous work, we …

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 …

We present in this paper an encoding in an extension with rewriting of the Edimburgh
Logical Framework (LF)[Harper et al., 1993] of two common features: universe …

Several proof assistants, such as Isabelle or Coq, can concurrently check multiple proofs. In
contrast, the vast majority of today's small proof checkers either does not support …

Proofs automatically generated by interactive or automated theorem provers are often
several orders of magnitude larger than proofs written by hand. This implies significant …