perm: permutation Applicative and Monad with many mtl instances

[ bsd3, control, library ] [ Propose Tags ]

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 <|> pure a should be used where addOpt a m would be used.

Versions 0.1.0.0, 0.1.0.1, 0.2.0.0, 0.2.0.1, 0.3.0.0, 0.3.0.1, 0.4.0.0
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 <andy22286@gmail.com>
Category Control
Home page https://github.com/sonyandy/perm
Bug tracker https://github.com/sonyandy/perm/issues
Source repo head: git clone git://github.com/sonyandy/perm.git
Uploaded by AndySonnenburg at Wed Oct 17 00:27:57 UTC 2012
Distributions NixOS:0.4.0.0
Downloads 2342 total (12 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

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees