Translating expressions between different logics and theorem provers is notoriously and
often prohibitively difficult, due to the large differences between the logical foundations, the …

The case for interfacing logic tools together has been made countless times in the literature,
but it is still an important research question. There are various logics and respective tools for …

Proofs by logical relations play a key role to establish rich properties such as normalization
or contextual equivalence. They are also challenging to mechanize. In this paper, we …

Abstract interpretation is a technique for developing static analyses. Yet, proving abstract
interpreters sound is challenging for interesting analyses, because of the high proof …

When proof assistants and theorem provers implement the metatheory of logical systems,
they must deal with a range of syntactic expressions (eg, types, formulas, and proofs) that …

Mechanical proofs by logical relations often involve tedious reasoning about substitution. In
this paper, we show that this is not necessarily the case, by developing, in Agda, a proof that …

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 …

PVS is one of the most powerful proof assistant systems and its libraries of formalized
mathematics are among the most comprehensive albeit under-appreciated ones. A …

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 (ie, solving equations between terms) is a key step in the implementation of logic
programming languages and theorem provers, and is also used in type inference algorithms …