name: representable-tries category: Data Structures, Functors, Monads, Comonads version: 2.5 x-revision: 1 license: BSD3 cabal-version: >= 1.6 license-file: LICENSE author: Edward A. Kmett maintainer: Edward A. Kmett stability: provisional homepage: http://github.com/ekmett/representable-tries/ bug-reports: http://github.com/ekmett/representable-tries/issues copyright: Copyright (C) 2011 Edward A. Kmett synopsis: Tries from representations of polynomial functors description: Tries from representations of polynomial functors build-type: Simple extra-source-files: .travis.yml source-repository head type: git location: git://github.com/ekmett/representable-tries.git library other-extensions: CPP EmptyDataDecls FlexibleContexts FlexibleInstances GADTs MultiParamTypeClasses Rank2Types ScopedTypeVariables TypeFamilies TypeOperators UndecidableInstances build-depends: base >= 4 && < 4.6, containers >= 0.3 && < 0.6, mtl >= 2.0.1 && < 2.2, transformers >= 0.2 && < 0.4, bifunctors >= 0.1.3.1 && < 0.2, comonad >= 1.1.1.5 && < 1.2, distributive >= 0.2.2 && < 0.3, semigroups >= 0.8.3.1 && < 0.9, semigroupoids >= 1.3.1.2 && < 1.4, keys >= 2.2 && < 2.3, comonad-transformers >= 2.1.1.1 && < 2.2, adjunctions >= 2.5 && < 2.6, representable-functors >= 2.5 && < 2.6 exposed-modules: Control.Monad.Reader.Trie Data.Functor.Representable.Trie Data.Functor.Representable.Trie.Bool Data.Functor.Representable.Trie.List Data.Functor.Representable.Trie.Either Data.Traversable.Fair Numeric.Nat.Zeroless ghc-options: -Wall