Henk Doornbos

According to our database, Henk Doornbos authored at least 10 papers between 1994 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of five.

2022

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

2008

Datatype-Generic Termination Proofs.

Roland Carl Backhouse, Henk Doornbos

Theory Comput. Syst., 2008

2000

Algebra of Program Termination.

Henk Doornbos, Roland Carl Backhouse

Proceedings of the Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, 2000

1998

On the Union of Well-Founded Relations.

Henk Doornbos, Burghard von Karger

Log. J. IGPL, 1998

1997

A Calculational Approach to Mathematical Induction.

Henk Doornbos, Roland Carl Backhouse, Jaap van der Woude

Theor. Comput. Sci., 1997

Programs and Datatypes.

Henk Doornbos, Netty van Gasteren, Roland Carl Backhouse

Proceedings of the Relational Methods in Computer Science., 1997

1996

Reductivity.

Henk Doornbos, Roland Carl Backhouse

Sci. Comput. Program., 1996

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

Induction and Recursion on Datatypes.

Henk Doornbos, Roland Carl Backhouse

Proceedings of the Mathematics of Program Construction, 1995

1994

A Relational Model of Programs Without the Restriction to Egli-Milner-Monotone Constructs.

Henk Doornbos

Proceedings of the Programming Concepts, 1994