Under consideration for publication in J. Functional Programming 1 Algebras for combinatorial search
by
Michael Spivey
BibTeX
@MISC{Spivey_underconsideration,
author = {Michael Spivey},
title = {Under consideration for publication in J. Functional Programming 1 Algebras for combinatorial search},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1
Citations
| 2959 | Artificial Intelligence: a Modern Approach - Russell, Norvig - 1995 |
| 205 | An introduction to the theory of lists - Bird - 1987 |
| 47 | Categories for the working mathematician, Springer-Verlag - Lane - 1971 |
| 43 | The under-appreciated unfold - Gibbons, Jones - 1998 |
| 42 | Introduction to Metric and Topological Spaces - Sutherland - 1975 |
| 20 | S.: Combinators for logic programming - Spivey, Seres |
| 10 | Prolog’s control constructs in a functional setting: Axioms and implementation - Hinze |
| 10 | Combinators for breadth-first search - Spivey |
| 1 | Sabry (2005) Backtracking, interleaving and terminating monad transformers - Kiselyov, Shan, et al. |
