We show how combinatorial search strategies including depth-first, breadth-first and depth-bounded search can be viewed as different implementations of a common algebraic specification that emphasises the compositionality of the strategies. This specification is placed in a categorical setting that combines algebraic specifications and monads.
Author and article information
Oxford University Computing Laboratory
Wolfson Building, Parks Road, Oxford OX1 3QD, UK