Each datatype constructor comes equiped not only with a so-called map and fold (<i>catamorphism</i>), as is widely known, but, under some condition, also with a kind of map and fold that are related to an arbitrary given monad. This result follows from the preservation of initiality under lifting from the category of algebras in a given category to a certain other category of algebras in the Kleisli category related to the monad
The theory and practice of polytypic programming is intimately connected with the initial algebra se...
Nested (or non-regular or non-uniform) datatypes are recursively defined parameterised datatypes in ...
AbstractWe introduce the notion of an equational lifting monad: a commutative strong monad satisfyin...
Each datatype constructor comes equiped not only with a so-called map and fold (<i>catamorphism</i>)...
Monads are becoming an increasingly important tool for structural functional programming, because th...
Associated research group: Critical Systems Research GroupReasoning about algebraic data types and f...
Abstract. In the quest for an elegant formulation of the notion of “polycategory” we develop a more ...
We introduce a method to lift monads on the base category of a fibration toits total category. This ...
This thesis develops a new approach to the theory of datatypes based on separating data and storage ...
The theory and practice of polytypic programming is intimately connected with the initial algebra ...
We present a detailed examination of applications of category theory to functional programming lang...
AbstractIn this extended abstract we provide a very brief overview of the notion of a monad along wi...
AbstractSketches are introduced as presentations of many-sorted algebraic theories and data types ar...
Abstract. This paper presents the semantics of database mappings in the rela-tional database (DB) ca...
We introduce the notion of an equational lifting monad: a commutative strong monad satisfying one ad...
The theory and practice of polytypic programming is intimately connected with the initial algebra se...
Nested (or non-regular or non-uniform) datatypes are recursively defined parameterised datatypes in ...
AbstractWe introduce the notion of an equational lifting monad: a commutative strong monad satisfyin...
Each datatype constructor comes equiped not only with a so-called map and fold (<i>catamorphism</i>)...
Monads are becoming an increasingly important tool for structural functional programming, because th...
Associated research group: Critical Systems Research GroupReasoning about algebraic data types and f...
Abstract. In the quest for an elegant formulation of the notion of “polycategory” we develop a more ...
We introduce a method to lift monads on the base category of a fibration toits total category. This ...
This thesis develops a new approach to the theory of datatypes based on separating data and storage ...
The theory and practice of polytypic programming is intimately connected with the initial algebra ...
We present a detailed examination of applications of category theory to functional programming lang...
AbstractIn this extended abstract we provide a very brief overview of the notion of a monad along wi...
AbstractSketches are introduced as presentations of many-sorted algebraic theories and data types ar...
Abstract. This paper presents the semantics of database mappings in the rela-tional database (DB) ca...
We introduce the notion of an equational lifting monad: a commutative strong monad satisfying one ad...
The theory and practice of polytypic programming is intimately connected with the initial algebra se...
Nested (or non-regular or non-uniform) datatypes are recursively defined parameterised datatypes in ...
AbstractWe introduce the notion of an equational lifting monad: a commutative strong monad satisfyin...