Algebras for Combinatorial Search

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.

Content

Author and article information

Contributors

Michael Spivey

Conference

Publication date: July 2006

Publication date (Print): July 2006

Pages: 1-14

Affiliations

[0001]Oxford University Computing Laboratory

Wolfson Building, Parks Road, Oxford OX1 3QD, UK

Article

DOI: 10.14236/ewic/MSFP2006.11

SO-VID: ecd2bc5e-28e4-4a98-a6fe-ef94ef3f2951

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Workshop on Mathematically Structured Functional Programming (MSFP 2006)

Conference acronym: MSFP

Conference number:

Conference location: Kuressaare, Estonia

Conference date: 2 July 2006

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Mathematically Structured Functional Programming

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/MSFP2006.11

Self URI (journal page): https://ewic.bcs.org/

Celebrating 65 years of The Computer Journal - free-to-read perspectives - bcs.org/tcj65

Algebras for Combinatorial Search

Abstract