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.\ud \ud 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
This thesis develops a new approach to the theory of datatypes based on separating data and storage ...
A new data type declaration mechanism of defining codatatypes is introduced to a functional programm...
AbstractThis paper demonstrates the potential for combining the polytypic and monadic programming st...
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...
The concept of dyad is defined as the least common generalisation of monads and co-monads. So, taki...
We present a detailed examination of applications of category theory to functional programming lang...
Category theory is proving a useful tool in programming and program specification - not only as a de...
We develop the formal theory of monads, as established by Street, in univalent foundations. This all...
We introduce a generalization of monads, called relative monads, allowing for underlying functors be...
AbstractThis paper presents a functional programming language, based on Moggi’s monadic metalanguage...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
In monadic programming, datatypes are presented as free algebras, generated by data values, and by t...
Monads are a central object of category theory and constitute crucial tools for many areas of Comput...
The theory and practice of polytypic programming is intimately connected with the initial algebra ...
This thesis develops a new approach to the theory of datatypes based on separating data and storage ...
A new data type declaration mechanism of defining codatatypes is introduced to a functional programm...
AbstractThis paper demonstrates the potential for combining the polytypic and monadic programming st...
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...
The concept of dyad is defined as the least common generalisation of monads and co-monads. So, taki...
We present a detailed examination of applications of category theory to functional programming lang...
Category theory is proving a useful tool in programming and program specification - not only as a de...
We develop the formal theory of monads, as established by Street, in univalent foundations. This all...
We introduce a generalization of monads, called relative monads, allowing for underlying functors be...
AbstractThis paper presents a functional programming language, based on Moggi’s monadic metalanguage...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
In monadic programming, datatypes are presented as free algebras, generated by data values, and by t...
Monads are a central object of category theory and constitute crucial tools for many areas of Comput...
The theory and practice of polytypic programming is intimately connected with the initial algebra ...
This thesis develops a new approach to the theory of datatypes based on separating data and storage ...
A new data type declaration mechanism of defining codatatypes is introduced to a functional programm...
AbstractThis paper demonstrates the potential for combining the polytypic and monadic programming st...