Design patterns are reusable abstractions in object-oriented software. However, using
current mainstream programming languages, these elements can only be expressed extra …

Functional programs are merely equations; they may be manipulated by straightforward
equational reasoning. In particular, one can use this style of reasoning to calculate …

The concept of recursive coalgebra of a functor was introduced in the 1970s by Osius in his
work on categorical set theory to discuss the relationship between wellfounded induction …

The paradigm of type-based termination is explored for functional programming with
recursive data types. The article introduces, a lambda-calculus with recursion, inductive …

Parser combinators are a middle ground between the fine control of hand-rolled parsers and
the high-level almost grammar-like appearance of parsers created via parser generators …

Folds and unfolds are at the heart of the algebra of programming. They allow the
cognoscenti to derive and manipulate programs rigorously and effectively. However, most, if …

Signal flow graphs are combinatorial models for linear dynamical systems, playing a
foundational role in control theory and engineering. In this survey, we overview a series of …

Induction and coinduction are two complementary techniques used in mathematics and
computer science. These techniques occur together, for example, in control systems: On the …

We introduce the, while still giving rise to a proof technique for bisimilarity. We first present a
theorem showing the validity of the resulting definition and proof principles for categories …

Folds over inductive datatypes are well understood and widely used. In their plain form, they
are quite restricted; but many disparate generalisations have been proposed that enjoy …