| Publication | Date of Publication | Type |
|---|
| Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant – ERRATUM | 2023-08-23 | Paper |
| Folding left and right matters: Direct style, accumulators, and continuations | 2023-06-19 | Paper |
| On the transformation between direct and continuation semantics | 2023-04-28 | Paper |
| Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant | 2022-11-18 | Paper |
| Getting There and Back Again | 2022-05-06 | Paper |
| Folding left and right over Peano numbers | 2019-11-22 | Paper |
| A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration | 2019-09-18 | Paper |
| A concrete framework for environment machines | 2017-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5277972 | 2017-07-12 | Paper |
| From Outermost Reduction Semantics to Abstract Machine | 2015-11-30 | Paper |
| Three syntactic theories for combinatory graph reduction | 2015-09-17 | Paper |
| Syntactic accidents in program analysis | 2015-09-11 | Paper |
| A characterization of Moessner's sieve | 2014-07-25 | Paper |
| On Barron and Strachey's cartesian product function | 2014-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2852349 | 2013-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2849585 | 2013-09-20 | Paper |
| Syntactic Theories in Practice | 2013-07-24 | Paper |
| On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation | 2012-06-25 | Paper |
| Three Syntactic Theories for Combinatory Graph Reduction | 2011-05-27 | Paper |
| Inter-deriving semantic artifacts for object-oriented programming | 2010-07-08 | Paper |
| Defunctionalized Interpreters for Call-by-Need Evaluation | 2010-05-04 | Paper |
| On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion | 2010-04-19 | Paper |
| Peter J. Landin (1930--2009) | 2010-03-05 | Paper |
| On obtaining the Boyer-Moore string-matching algorithm by partial evaluation | 2010-01-29 | Paper |
| On the dynamic extent of delimited continuations | 2009-12-18 | Paper |
| CPS transformation of beta-redexes | 2009-12-04 | Paper |
| From Reduction-Based to Reduction-Free Normalization | 2009-12-03 | Paper |
| Refunctionalization at work | 2009-07-24 | Paper |
| A functional correspondence between call-by-need evaluators and lazy abstract machines | 2009-07-21 | Paper |
| A Rational Deconstruction of Landin's SECD Machine with the J Operator | 2009-04-29 | Paper |
| A Rational Deconstruction of Landin’s J Operator | 2009-04-28 | Paper |
| Inter-deriving Semantic Artifacts for Object-Oriented Programming | 2008-07-10 | Paper |
| On one-pass CPS transformations | 2007-11-22 | Paper |
| A Rational Deconstruction of Landin’s SECD Machine | 2007-10-23 | Paper |
| An Operational Foundation for Delimited Continuations in the CPS Hierarchy | 2007-10-11 | Paper |
| A syntactic correspondence between context-sensitive calculi and abstract machines | 2007-05-11 | Paper |
| On the static and dynamic extents of delimited continuations | 2006-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5472881 | 2006-06-19 | Paper |
| THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control | 2006-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3372478 | 2006-02-21 | Paper |
| Logic Based Program Synthesis and Transformation | 2005-12-27 | Paper |
| A functional correspondence between monadic evaluators and abstract machines for languages with computational effects | 2005-09-22 | Paper |
| A first-order one-pass CPS transformation | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738220 | 2004-08-11 | Paper |
| Syntactic accidents in program analysis: on the impact of the CPS transformation | 2004-03-29 | Paper |
| CPS transformation of flow information, Part II: administrative reductions | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4445769 | 2004-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4445770 | 2004-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440321 | 2003-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417784 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417903 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414735 | 2003-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414737 | 2003-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409156 | 2003-06-30 | Paper |
| A Simple CPS Transformation of Control-Flow Information | 2003-05-07 | Paper |
| A unifying approach to goal-directed evaluation | 2002-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766784 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778811 | 2002-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2763631 | 2002-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2763648 | 2002-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2752057 | 2001-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499196 | 2001-03-06 | Paper |
| Normalization by evaluation with typed abstract syntax | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518878 | 2000-12-03 | Paper |
| Lambda-dropping: Transforming recursive equations into programs with block structure | 2000-10-26 | Paper |
| Functional unparsing | 1999-05-03 | Paper |
| Thunks and the λ-calculus | 1998-02-16 | Paper |
| A computational formalization for partial evaluation | 1997-11-20 | Paper |
| Representing Control: a Study of the CPS Transformation | 1994-10-31 | Paper |
| Back to direct style | 1994-07-21 | Paper |
| Automatic autoprojection of recursive equations with global variables and abstract data types | 1992-06-28 | Paper |
