| Publication | Date of Publication | Type |
|---|
| A greedy algorithm for dropping digits | 2022-01-07 | Paper |
| Algorithm Design with Haskell | 2020-08-10 | Paper |
| An optimal, purely functional implementation of the Garsia–Wachs algorithm | 2020-05-26 | Paper |
| How to find a fake coin | 2019-11-22 | Paper |
| How to mingle streams | 2017-10-23 | Paper |
| On computing representatives | 2016-05-26 | Paper |
| An in-situ algorithm for expanding a graph | 2013-06-14 | Paper |
| A simple division-free algorithm for computing determinants | 2013-04-04 | Paper |
| On building cyclic and shared structures in Haskell | 2013-03-22 | Paper |
| Building a consensus: A rectangle covering problem | 2011-07-25 | Paper |
| Arithmetic Coding with Folds and Unfolds | 2011-04-01 | Paper |
| Minimal on-line labelling | 2010-01-29 | Paper |
| Programming Languages and Systems | 2010-01-05 | Paper |
| Loopless Functional Algorithms | 2009-04-02 | Paper |
| Improving Saddleback Search: A Lesson in Algorithm Design | 2009-04-02 | Paper |
| Zippy Tabulations of Recursive Functions | 2008-08-28 | Paper |
| FUNCTIONAL PEARL: Enumerating the rationals | 2006-06-09 | Paper |
| FUNCTIONAL PEARLS: Finding celebrities: A lesson in functional programming | 2006-01-13 | Paper |
| Countdown: A case study in origami programming | 2005-10-11 | Paper |
| FUNCTIONAL PEARL Inverting the Burrows–Wheeler transform | 2005-03-21 | Paper |
| FUNCTIONAL PEARL On tiling a chessboard | 2005-03-21 | Paper |
| Theory and applications of inverting functions as folds | 2004-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808695 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738116 | 2004-08-11 | Paper |
| Maximum marking problems | 2001-11-21 | Paper |
| Unfolding pointer algorithms | 2001-07-23 | Paper |
| Generalised folds for nested datatypes | 2000-02-06 | Paper |
| Meertens number | 1999-11-21 | Paper |
| de Bruijn notation as a nested datatype | 1999-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362958 | 1998-05-25 | Paper |
| FUNCTIONAL PEARL | 1998-02-25 | Paper |
| FUNCTIONAL PEARL On building trees with minimum height | 1998-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331824 | 1997-02-11 | Paper |
| Functional algorithm design | 1996-12-12 | Paper |
| Generic functional programming with types and relations | 1996-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4885873 | 1996-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281662 | 1994-04-07 | Paper |
| List partitions | 1993-06-29 | Paper |
| The smallest upravel | 1992-09-27 | Paper |
| Formal derivation of a pattern matching algorithm | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782766 | 1987-01-01 | Paper |
| A formal development of an efficient supercombination compiler | 1987-01-01 | Paper |
| Transformational programming and the paragraph problem | 1986-01-01 | Paper |
| Using circular programs to eliminate multiple traversals of data | 1984-01-01 | Paper |
| The promotion and accumulation strategies in transformational programming | 1984-01-01 | Paper |
| The jogger's problem | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3919065 | 1980-01-01 | Paper |
| Recursion elimination with variable parameters | 1979-01-01 | Paper |
| Improving programs by the introduction of recursion | 1977-01-01 | Paper |
| Notes on recursion elimination | 1977-01-01 | Paper |
| Non recursive functionals | 1975-01-01 | Paper |
| On transformations of programs | 1974-01-01 | Paper |
| Speeding up Programs | 1974-01-01 | Paper |
| A note on definition by cases | 1973-01-01 | Paper |
| Integers with Given Initial Digits | 1972-01-01 | Paper |
