Lenses--bidirectional transformations between pairs of connected structures--have been
extensively studied and are beginning to find their way into industrial practice. However …

Building on Wouter Swierstra's Data types à la carte, we present a comprehensive Haskell
library of compositional data types suitable for practical applications. In this framework, data …

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

This dissertation encompasses the topics contract formalisation, domainspecific languages
implementation, and enterprise resource planning systems. The dissertation is a collection …

This paper introduces basic theoretical knowledge of coalgebras in computer science.
Coalgebras are, specifically in category theory, structures defined according to an …

Modern computer programs are executed in a variety of different contexts: on servers,
handheld devices, graphics cards, and across distributed environments, to name a few …

The Mendler style catamorphism (which corresponds to weak induction) always terminates
even for negative inductive datatypes. The Mendler style histomorphism (which corresponds …

When is a function a fold or an unfold? Page 1 Electronic Notes in Theoretical Computer
Science 44 No. 1 (2001) URL: http://www.elsevier.nl/locate/entcs/volume44.html 15 pages When …

Within the setting of the categorical approach to total functional programming, we introduce
a\many-in-one" recursion scheme that neatly uni es a variety of seemingly diverging …

Already in ancient Greece, the Spartans were worried about the privacy of their messages
during military conflicts and used a transposition cipher (scytale) to render their messages …