Rewriting logic is a simple computational logic that can naturally express both concurrent
computation and logical deduction with great generality. This paper provides a gentle …

The LF logical framework codifies a methodology for representing deductive systems, such
as programming languages and logics, within a dependently typed λ-calculus. In this …

Mechanical reasoning is a key area of research that lies at the crossroads of mathematical
logic and artificial intelligence. The main aim to develop mechanical reasoning systems …

We developed an importer from both HOL 4 and HOL-light into Isabelle/HOL. The importer
works by replaying proofs within Isabelle/HOL that have been recorded in HOL 4 or HOL …

We give general definitions of logical frameworks and logics. Examples include the logical
frameworks LF and Isabelle and the logics represented in them. We apply this to give …

The main aim of this thesis is to make formal proofs more universal by expressing them in a
common logical framework. More specifically, we use the lambda-Pi-calculus modulo …

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 …

Module systems for proof assistants provide administrative support for large developments
when mechanizing the meta-theory of programming languages and logics. We describe a …

Dedukti is a logical framework based on the lambda-Pi-calculus modulo rewriting, which
extends the lambda-Pi-calculus with rewrite rules. In this paper, we show how to translate …

LF is a meta-logical framework that has become a standard tool for representing logics and
studying their properties. Its focus is proof theoretic, employing the Curry-Howard …