name: action-permutations version: license: BSD3 license-file: LICENSE author: Ross Paterson maintainer: Ross Paterson category: Control synopsis: Execute a set of actions (e.g. parsers) in each possible order description: 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. build-type: Simple cabal-version: >= 1.2 flag ApplicativeInBase description: Choose the newer base package, including Applicative and other Functor classes. library if flag(ApplicativeInBase) build-depends: base >= 2 else build-depends: base >= 1.0 && < 2, special-functors >=1.0 && <1.1 exposed-modules: Control.Applicative.Permutation extensions: ExistentialQuantification