We present calf, ac ost-a ware l ogical f ramework for studying quantitative aspects of
functional programs. Taking inspiration from recent work that reconstructs traditional aspects …

We present our experiences teaching two courses on formal methods and detail the
contents of the courses and their positioning in the curriculum. The first course is a bachelor …

Algorithms on restructuring binary search trees are typically presented in imperative
pseudocode. Understandably so, as their performance relies on in-place execution, rather …

The paper" Sorting with Bialgebras and Distributive Laws" by Hinze et al. uses the
framework of bialgebraic semantics to define sorting algorithms. From distributive laws …

We present a first-order theorem proving framework for establishing the correctness of
functional programs implementing sorting algorithms with recursive data structures. We …

This entry contains an Isabelle formalization of the Number Theoretic Transform (NTT) which
is the analogue to a Discrete Fourier Transform (DFT), just over a finite field. Roots of unity in …

We present a novel approach for teaching logic and the metatheory of logic to students who
have some experience with functional programming. We define concepts in logic as a series …

This thesis explores automating inductive reasoning for software verification of programs
containing loops, arrays and recursive function calls. We propose new methods of …

In the recent decades, computers have opened up novel ways of doing mathematics. The
speed and raw power of computers has been used to perform searches over previously …

Abstract The van Emde Boas tree or van Emde Boas priority queue [1, 2] is a data structure
supporting membership test, insertion, predecessor and successor search, minimum and …