The use of interactive theorem provers to establish the correctness of critical parts of a
software development or for formalizing mathematics is becoming more common and …

The aim of this thesis is to provide an infrastructure for general recursive function definitions
in a proof assistant based on higher-order logic (HOL) that has no native support for …

Based on inductive definitions, we develop a tool that automates the definition of partial
recursive functions in higher-order logic (HOL) and provides appropriate proof rules for …

Proof-by-reflection is a well-established technique that employs decision procedures to
reduce the size of proof-terms. Currently, decision procedures can be written either in Type …

We propose to use the Knaster-Tarski least fixed point theorem as a basis to define
recursive functions in the Calculus of Inductive Constructions. This widens the class of …

We show how various Haskell language features that are related to ambient effects can be
modeled in Coq. For this purpose we build on previous work that demonstrates how to …

Martin-Löf type theory is a formal system for the development of constructive mathematics
and a very expressive functional programming language. In this language, it is possible to …

We show that restricting the elimination principle of the natural numbers type in Martin-Löf
Type Theory (MLTT) to a universe of types not containing#### II-types ensures that all …

This is a survey article on the use of coalgebras in functional programming and type theory.
It presents the basic theory underlying the implementation of coinductive types, families and …

We present recent developments in the Flowchart Writer (FloWr) project, where we have
built a framework for implementing creative systems as flowcharts of processing nodes. We …