representable-tries-0.3.4: representable-tries.cabal

name:          representable-tries
category:      Data Structures, Functors, Monads, Comonads
version:       0.3.4
license:       BSD3
cabal-version: >= 1.6
license-file:  LICENSE
author:        Edward A. Kmett
maintainer:    Edward A. Kmett <ekmett@gmail.com>
stability:     provisional
homepage:      http://github.com/ekmett/representable-tries/
copyright:     Copyright (C) 2011 Edward A. Kmett
synopsis:      Tries from representations of polynomial functors
description:   Tries from representations of polynomial functors
build-type:    Simple

source-repository head
  type: git
  location: git://github.com/ekmett/representable-tries.git

library
  build-depends: 
    adjunctions >= 0.9.2 && < 0.10,
    base >= 4 && < 4.4,
    bifunctors >= 0.1 && < 0.2,
    comonad >= 1.1 && < 1.2,
    comonad-transformers >= 1.6.2 && < 1.7.0,
    containers >= 0.3 && < 0.5,
    distributive >= 0.2 && < 0.3,
    keys >= 0.2.5 && < 0.3,
    mtl >= 2.0.1.0 && < 2.1,
    representable-functors >= 0.4.1 && < 0.5,
    semigroups >= 0.5 && < 0.6,
    semigroupoids >= 1.2.1 && < 1.3.0,
    streams >= 0.7 && < 0.8,
    transformers >= 0.2.0 && < 0.3

  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

--     Data.Vector.Zeroless
  ghc-options: -Wall