• DOI:10.1145/1086365.1086390
Corpus ID: 1435535

Backtracking, interleaving, and terminating monad transformers: (functional pearl)

@inproceedings{Kiselyov2005BacktrackingIA,
  title={Backtracking, interleaving, and terminating monad transformers: (functional pearl)},
  author={O. Kiselyov and C. Shan and D. Friedman and A. Sabry},
  booktitle={ICFP '05},
  year={2005}
}

O. Kiselyov, C. Shan, +1 author A. Sabry

Published in ICFP '05 2005

Computer Science

We design and implement a library for adding backtracking computations to any Haskell monad. Inspired by logic programming, our library provides, in addition to the operations required by the MonadPlus interface, constructs for fair disjunctions, fair conjunctions, conditionals, pruning, and an expressive top-level interface. Implementing these additional constructs is easy in models of backtracking based on streams, but not known to be possible in continuation-based models. We show that all… CONTINUE READING

View on ACM

cs.indiana.edu

Save to Library

Create Alert

Cite

Launch Research Feed