Algebras for combinatorial search

Authors:
Michael Spivey
Affiliations:
Oxford University Computing Laboratory, Oxford, UK
Venue:
MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming
Year:
2006

Citing 6
Cited 2

An introduction to the theory of lists

Proceedings of the NATO Advanced Study Institute on Logic of programming and calculi of discrete design
The under-appreciated unfold

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
Combinators for breadth-first search

Journal of Functional Programming
Relating models of backtracking

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Backtracking, interleaving, and terminating monad transformers: (functional pearl)

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming

Inductive reasoning about effectful data types

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Efficient Exhaustive Generation of Functional Programs Using Monte-Carlo Search with Iterative Deepening

PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.