perm-0.1.0.1: permutation Applicative and Monad with many mtl instances

The perm package

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.

Properties

Versions0.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
Dependenciesbase (4.*), catch-fd (≥0.2 & <0.4), mtl (≥2.0 & <2.2), transformers (≥0.2 & <0.4)
LicenseBSD3
AuthorAndy Sonnenburg
MaintainerAndy Sonnenburg <andy22286@gmail.com>
CategoryControl
Home pagehttps://github.com/sonyandy/perm
Bug trackerhttps://github.com/sonyandy/perm/issues
Source repositorygit clone git://github.com/sonyandy/perm.git
Upload dateWed Oct 17 00:27:57 UTC 2012
Uploaded byAndySonnenburg
Built onghc-7.6

Modules

Downloads