perm: permutation Applicative and Monad with many mtl instances
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 should
be used where <*> (lift n <|> pure a)addOpt m a n
Downloads
- perm-0.4.0.0.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.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 && <5), 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 2012-11-11T19:19:30Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 5076 total (8 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] |