Loading...
Please wait, while we are loading the content...
Similar Documents
Reinventing Haskell Backtracking
| Content Provider | CiteSeerX |
|---|---|
| Author | Fischer, Sebastian |
| Abstract | Abstract: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive backtracking functionality for the purely functional programming language Haskell. In these notes, we show how to arrive at the efficient, two-continuation based backtracking monad derived by Hinze starting from an intuitive inefficient implementation that we subsequently refine using well known program transformations. It turns out that the technique can be used to build monads for non-determinism from modular, independent parts which gives rise to various new implementations. Specifically, we show how the presented approach can be applied to obtain new implementations of breadth-first search and iterative deepening depth-first search. 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Backtracking Functionality Independent Part Various New Implementation Program Transformation Haskell Backtracking Ralf Hinze Presented Approach Depth-first Search Functional Pearl Breadth-first Search Purely Functional Programming Language Haskell New Implementation Intuitive Inefficient Implementation |
| Content Type | Text |
| Resource Type | Article |
