Algebras for combinatorial search

DOI10.1017/S0956796809007321zbMath1191.68454MaRDI QIDQ3638924

J. M. Spivey

Publication date: 28 October 2009

Published in: Journal of Functional Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Functional programming and lambda calculus (68N18)

Related Items (4)

A functional account of probabilistic programming with possible worlds. Declarative pearl ⋮ Structured handling of scoped effects ⋮ Composable Discovery Engines for Interactive Theorem Proving ⋮ List Objects with Algebraic Structure

Cites Work

• Unnamed Item
• Unnamed Item
• Backtracking, interleaving, and terminating monad transformers
• Combinators for breadth-first search
• PROLOG'S CONTROL CONSTRUCTS IN A FUNCTIONAL SETTING — AXIOMS AND IMPLEMENTATION
• The under-appreciated unfold

This page was built for publication: Algebras for combinatorial search