Algebras for combinatorial search

J. MICHAEL SPIVEY
2009 Journal of functional programming  
Combinatorial search strategies including depth-first, breadth-first and depth-bounded search are shown to be 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.
doi:10.1017/s0956796809007321 fatcat:p6yraoyb75cu7bmbz4fjrcxoum