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 theory and applications of rewriting logic have been vigorously developed by
researchers all over the world during the past eleven years. The attached bibliography …

This chapter describes some existing Maude-based tools that are available for download.
The first section describes tools concerned with analysis of either Maude specifications, or of …

By interactive theorem proving, we mean some arrangement where the machine and a
human user work together interactively to produce a formal proof. There is a wide spectrum …

We present C-CoRN, the Constructive Coq Repository at Nijmegen. It consists of a
mathematical library of constructive algebra and analysis formalized in the theorem prover …

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 compare fifteen systems for the formalizations of mathematics with the computer. We
present several tables that list various properties of these programs. The three main …

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 …

Mathematical knowledge is publicly available in dozens of different formats and languages,
ranging from informal (eg Wikipedia) to formal corpora (eg, Mizar). Despite an enormous …

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 …