A Relational Model of Programs Without the Restriction to Egli-Milner-Monotone Constructs. - Henk Doornbos (PROCOMET, 1994)

Induction and Recursion on Datatypes. - Henk Doornbos; Roland Carl Backhouse (MPC, 1995)

Fixed-Point Calculus. - Chritiene Aarts; Roland Carl Backhouse; Eerke A. Boiten; Henk Doornbos; Netty van Gasteren; Rik van Geldrop; Paul F. Hoogendijk; Ed Voermans; Jaap van der Woude (Inf. Process. Lett., 1995)

Reductivity. - Henk Doornbos; Roland Carl Backhouse (Sci. Comput. Program., 1996)

Programs and Datatypes. - Henk Doornbos; Netty van Gasteren; Roland Carl Backhouse (Relational Methods in Computer Science, 1997)

A Calculational Approach to Mathematical Induction. - Henk Doornbos; Roland Carl Backhouse; Jaap van der Woude (Theor. Comput. Sci., 1997)

On the Union of Well-Founded Relations. - Henk Doornbos; Burghard von Karger (Log. J. IGPL, 1998)

Algebra of Program Termination. - Henk Doornbos; Roland Carl Backhouse (Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, 2000)

Datatype-Generic Termination Proofs. - Roland Carl Backhouse; Henk Doornbos (Theory Comput. Syst., 2008)

Components and acyclicity of graphs. An exercise in combining precision with concision. - Roland Carl Backhouse; Henk Doornbos; Roland Glück; Jaap van der Woude (J. Log. Algebraic Methods Program., 2022)