Interactive theorem provers (ITPs), such as Lean and Coq, can express formal proofs for a
large category of theorems, from abstract math to software correctness. Consider Alice who …

Proving equivalence between functional programs is a fundamental problem in program
verification, which often amounts to reasoning about algebraic data types (ADTs) and …

The increasing complexity of software systems presents a growing challenge to the societal
and legal governance of modern technology. Understanding how algorithmic decisions are …