representable-tries-3.0.2: representable-tries.cabal

name:          representable-tries
category:      Data Structures, Functors, Monads, Comonads
version:       3.0.2
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/
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:
  .ghci
  .gitignore
  .travis.yml
  .vim.custom
  README.markdown
  CHANGELOG.markdown

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

library
  hs-source-dirs: src

  other-extensions:
    CPP
    EmptyDataDecls
    FlexibleContexts
    FlexibleInstances
    GADTs
    MultiParamTypeClasses
    Rank2Types
    ScopedTypeVariables
    TypeFamilies
    TypeOperators
    UndecidableInstances

  build-depends:
    adjunctions            >= 3,
    base                   >= 4       && < 5,
    bifunctors             >= 3,
    comonad                >= 3,
    comonad-transformers   >= 3,
    containers             >= 0.3     && < 0.6,
    distributive           >= 0.2.2,
    keys                   >= 3.0.0.1,
    mtl                    >= 2.0.1   && < 2.2,
    transformers           >= 0.2     && < 0.4,
    representable-functors >= 3.0.0.1,
    semigroups             >= 0.8.3.1,
    semigroupoids          >= 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

  ghc-options: -Wall