Abstract Development of formal proofs of correctness of programs can increase actual and
perceived reliability and facilitate better understanding of program specifications and their …

IsaFoL (Isabelle Formalization of Logic) is an undertaking that aims at develo** formal
theories about logics, proof systems, and automatic provers, using Isabelle/HOL. At the heart …

Bisimulation is an instance of coinduction. Both bisimulation and coinduction are today
widely used, in many areas of Computer Science, as well as outside Computer Science …

It is common to model inductive datatypes as least fixed points of functors. We show that
within the Cedille type theory we can relax functoriality constraints and generically derive an …

We present a formalization of the first half of Bachmair and Ganzinger's chapter on
resolution theorem proving in Isabelle/HOL, culminating with a refutationally complete first …

Interactive theorem provers (or proof assistants) are software with which mathematical
definitions and theorems can be formalised. They assist the user in writing formal proofs and …

This paper proposes a new approach to writing and verifying divide-and-conquer programs
in Coq. Extending the rich line of previous work on algebraic approaches to recursion …

This paper presents generic derivations of induction for impredicatively typed lambda-
encoded datatypes, in the Cedille type theory. Cedille is a pure type theory extending the …

We present an Isabelle/HOL formalization of the first half of Bachmair and Ganzinger's
chapter on resolution theorem proving, culminating with a refutationally complete first-order …

A broad class of data types, including arbitrary nestings of inductive types, coinductive types,
and quotients, can be represented as quotients of polynomial functors. This provides …