Algebras for Combinatorial Search

@article{Spivey2006AlgebrasFC,
  title={Algebras for Combinatorial Search},
  author={J. Michael Spivey},
  journal={J. Funct. Program.},
  year={2006},
  volume={19},
  pages={469-487}
}
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. 
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Combinators for logic programming

Spivey, J.M, S. Seres
In The Fun of Programming, J Gibbons and O de Moor (eds), • 2003

Combinators for breadth-first search

J. Funct. Program. • 2000
View 1 Excerpt

An introduction to the theory of lists

R. S. Bird
Calculi of Discrete Design, NATO ASI Series, • 1987
View 2 Excerpts

Algorithmics – Towards programming as a mathematical activity

Meertens, T L.G.L.
Proc. C. W. I. Symposium on Mathematics and Computer Science. C. W. I. Monograph • 1986

Similar Papers

Loading similar papers…