Symbolic and logic computation systems ranging from computer algebra systems to theorem
provers are finding their way into science, technology, mathematics and engineering. But …

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 …

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 …

Unification is a core component of every proof assistant or programming language featuring
dependent types. In many cases, it must deal with higher-order problems up to conversion …

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 …

The paper describes the new kernel for the Calculus of Inductive Constructions (CIC)
implemented inside the Matita Interactive Theorem Prover. The design of the new kernel has …

Unification is a central operation in the construction of a range of computational logic
systems based on first-order and higher-order logics. First-order unification has a number of …

We propose a synthesis of the two proof styles of interactive theorem proving: the procedural
style (where proofs are scripts of commands, like in Coq) and the declarative style (where …

Unification is a core component of every proof assistant or programming language featuring
dependent types. In many cases, it must deal with higher order problems up to conversion …

Mmt is a framework for designing and implementing formal systems in a way that
systematically abstracts from theoretical and practical aspects of their type of theoretical and …