action-permutations: Execute a set of actions (e.g. parsers) in each possible order
Sequence a set of Alternative actions in each possible order, based on "Parsing Permutation Phrases", by Arthur Baars, Andres Loeh and S. Doaitse Swierstra, Haskell Workshop 2001. This is particularly useful for constructing a parser for permutations of elements. This version has a slightly different interface from the paper.
Downloads
- action-permutations-0.0.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.0.0.0, 0.0.0.1 |
|---|---|
| Dependencies | base (>=2 && <5) [details] |
| License | BSD-3-Clause |
| Author | Ross Paterson <ross@soi.city.ac.uk> |
| Maintainer | Ross Paterson <ross@soi.city.ac.uk> |
| Category | Control |
| Source repo | head: darcs get http://code.haskell.org/~ross/action-permutations |
| Uploaded | by RossPaterson at 2014-04-11T19:12:15Z |
| Distributions | LTSHaskell:0.0.0.1, NixOS:0.0.0.1, Stackage:0.0.0.1 |
| Reverse Dependencies | 3 direct, 0 indirect [details] |
| Downloads | 3460 total (15 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Successful builds reported [all 1 reports] |