representable-tries-0.2.3: representable-tries.cabal

name:          representable-tries
category:      Data Structures, Functors, Monads, Comonads
version:       0.2.3
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 && < 0.10,
    array >= 0.3.0.2 && < 0.4,
    base >= 4 && < 4.4,
    comonad >= 1.0 && < 1.1,
    comonad-transformers >= 1.5.2 && < 1.6,
    containers >= 0.4 && < 0.5,
    contravariant >= 0.1.2 && < 0.2,
    distributive >= 0.1.1 && < 0.2,
    eq >= 0.2 && < 0.3,
    keys >= 0.2.1 && < 0.3,
    mtl >= 2.0.1.0 && < 2.1,
    representable-functors >= 0.3 && < 0.4,
    semigroups >= 0.3.4 && < 0.4,
    semigroupoids >= 1.1.1 && < 1.2.0,
    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.Semigroupoid.Trie

  ghc-options: -Wall