action-permutations: Execute a set of actions (e.g. parsers) in each possible order

[ bsd3, control, library ] [ Propose Tags ]

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.

Modules

[Index]

Flags

Automatic Flags
NameDescriptionDefault
applicativeinbase

Choose the newer base package, including Applicative and other Functor classes.

Enabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.0.0.0, 0.0.0.1
Dependencies base (>=1.0), special-functors (>=1.0 && <1.1) [details]
License BSD-3-Clause
Author Ross Paterson <ross@soi.city.ac.uk>
Maintainer Ross Paterson <ross@soi.city.ac.uk>
Category Control
Uploaded by RossPaterson at 2009-04-30T11:04:50Z
Distributions LTSHaskell:0.0.0.1, NixOS:0.0.0.1, Stackage:0.0.0.1
Reverse Dependencies 3 direct, 0 indirect [details]
Downloads 3253 total (25 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]