| Publication | Date of Publication | Type |
|---|
| Profunctor optics, a categorical update | 2024-05-10 | Paper |
| Algorithm design with the selection monad | 2023-08-03 | Paper |
| Breadth-first traversal via staging | 2023-06-30 | Paper |
| How to design co-programs | 2021-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5854730 | 2021-03-17 | Paper |
| Quantitative Information Flow with Monads in Haskell | 2021-02-16 | Paper |
| Algorithm Design with Haskell | 2020-08-10 | Paper |
| Coding with asymmetric numeral systems | 2020-05-05 | Paper |
| The under-appreciated unfold | 2019-09-26 | Paper |
| Introduction to bidirectional transformations | 2019-02-15 | Paper |
| Programming with ornaments | 2017-10-23 | Paper |
| The under-appreciated unfold | 2017-08-21 | Paper |
| Modules over Monads and their Algebras | 2017-07-11 | Paper |
| APLicative Programming with Naperian Functors | 2017-05-19 | Paper |
| Kernels, in a nutshell | 2016-12-15 | Paper |
| Folding domain-specific languages: deep and shallow embeddings (functional pearl) | 2016-09-29 | Paper |
| Conjugate hylomorphisms -- or: the mother of all structured recursion schemes | 2016-09-29 | Paper |
| Comprehending Ringads | 2016-08-17 | Paper |
| Reflections on Monadic Lenses | 2016-08-17 | Paper |
| The coinductive resumption monad | 2016-05-13 | Paper |
| Monads for behaviour | 2016-04-12 | Paper |
| Unifying Theories of Programming with Monads | 2015-12-11 | Paper |
| Notions of Bidirectional Computation and Entangled State Monads | 2015-08-27 | Paper |
| Unifying structured recursion schemes | 2015-03-30 | Paper |
| A Relative Timed Semantics for BPMN | 2015-03-19 | Paper |
| Just do it | 2015-03-05 | Paper |
| Incremental updates for efficient bidirectional transformations | 2015-03-05 | Paper |
| When is a function a fold or an unfold? | 2013-04-26 | Paper |
| Property specifications for workflow modelling | 2011-07-18 | Paper |
| Formalisations and applications of BPMN | 2011-06-07 | Paper |
| Arithmetic coding with folds and unfolds | 2011-04-01 | Paper |
| Scala for generic programmers | 2011-01-26 | Paper |
| Unifying theories of locations | 2010-08-31 | Paper |
| Gradual refinement. Blending pattern matching with data abstraction | 2010-07-26 | Paper |
| The essence of the <scp>Iterator</scp> pattern | 2009-10-28 | Paper |
| Fission for Program Comprehension | 2009-04-02 | Paper |
| Unifying Theories of Objects | 2009-03-06 | Paper |
| Property Specifications for Workflow Modelling | 2009-02-24 | Paper |
| Unfolding Abstract Datatypes | 2008-08-28 | Paper |
| Metamorphisms: streaming representation-changers | 2007-03-12 | Paper |
| Unbounded Spigot Algorithms for the Digits of Pi | 2006-07-11 | Paper |
| Proof methods for corecursive programs | 2006-06-19 | Paper |
| FUNCTIONAL PEARL: Enumerating the rationals | 2006-06-09 | Paper |
| Mathematics of Program Construction | 2005-08-26 | Paper |
| Disciplined, efficient, generalised folds for nested datatypes | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738113 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738116 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738187 | 2004-08-11 | Paper |
| On the semantics of nested datatypes | 2002-07-25 | Paper |
| The generic approximation lemma | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767187 | 2002-01-28 | Paper |
| A pointless derivation of radix sort | 2000-12-05 | Paper |
| Bridging the algorithm gap: A linear-time functional program for paragraph formatting | 2000-11-28 | Paper |
| Generic downwards accumulations | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234514 | 1999-11-08 | Paper |
| Computing downwards accumulations on trees quickly | 1997-10-19 | Paper |
| Functional Pearls | 1997-08-07 | Paper |
| Functional Pearls | 1997-04-29 | Paper |
| Efficient parallel algorithms for tree accumulations | 1996-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281667 | 1994-04-07 | Paper |
| Formal derivation of a pattern matching algorithm | 1989-01-01 | Paper |
