perm: permutation Applicative and Monad with many mtl instances

[ bsd3, control, library ] [ Propose Tags ]
Dependencies base (==4.*), catch‑fd (>=0.2 && <0.4), mtl (>=2.0 && <2.2), transformers (>=0.2 && <0.4) [details]
License BSD-3-Clause
Author Andy Sonnenburg
Maintainer Andy Sonnenburg <>
Category Control
Home page
Bug tracker
Source repo head: git clone git://
Uploaded by AndySonnenburg at Sun Nov 11 19:19:30 UTC 2012
Distributions NixOS:
Downloads 2330 total (19 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Based on "Parsing Permutation Phrases", by Arthur Baars, Andres Loeh and S. Doaitse Swierstra, Haskell Workshop 2001. The implementation given here does not include explicit optional actions, and instead implements Alternative and MonadPlus. m <*> (lift n <|> pure a) should be used where addOpt m a n would be used.




Maintainer's Corner

For package maintainers and hackage trustees