The area of coalgebra has emerged within theoretical computer science with a unifying
claim: to be the mathematics of computational dynamics. It combines ideas from the theory of …

The endless transformation of technological innovation requires greater collaboration of
Information Communication and Technology (ICT) in various areas especially in public …

The work in this thesis has been carried out at the Centrum Wiskunde & Informatica, under
the auspices of the research school IPA (Institute for Programming research and …

Several algorithmic variants of circular coinduction have been proposed and implemented
during the last decade, but a proof theoretical foundation of circular coinduction in its full …

We study a cyclic proof system C over regular expression types, inspired by linear logic and
non-wellfounded proof theory. Proofs in C can be seen as strongly typed goto programs. We …

We introduce AmiCo, a tool that extends a proof assistant, Isabelle/HOL, with flexible
function definitions well beyond primitive corecursion. All definitions are certified by the …

Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich
theory partly due to their ubiquity in mathematics and computer science. Stream differential …

We present in this paper an interpreter implemented in Maude for non-behavioral CafeOBJ
specifications. This alternative implementation poses a number of advantages:(1) it allows …

In this paper, we present a systematic way of deriving (1) languages of (generalised) regular
expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of …

We present a systematic way to generate (1) languages of (generalised) regular
expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of …