Cabal revisions of representable-tries-2.2
Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.
revision 1
-name: representable-tries-category: Data Structures, Functors, Monads, Comonads-version: 2.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/-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- other-extensions:- CPP- EmptyDataDecls- FlexibleContexts- FlexibleInstances- GADTs- MultiParamTypeClasses- Rank2Types- ScopedTypeVariables- TypeFamilies- TypeOperators- UndecidableInstances-- build-depends:- base >= 4 && < 5,- containers >= 0.3 && < 0.5,- mtl >= 2.1 && < 2.2,- transformers >= 0.3 && < 0.4,- bifunctors >= 0.1.3 && < 0.2,- comonad >= 1.1.1.3 && < 1.2,- distributive >= 0.2.1 && < 0.3,- semigroups >= 0.8.2 && < 0.9,- semigroupoids >= 1.3 && < 1.4,- keys >= 2.1.3 && < 2.2,- comonad-transformers >= 2.1 && < 2.2,- adjunctions >= 2.2 && < 2.3,- representable-functors >= 2.2 && < 2.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+name: representable-tries +category: Data Structures, Functors, Monads, Comonads +version: 2.2 +x-revision: 1 +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 + other-extensions: + CPP + EmptyDataDecls + FlexibleContexts + FlexibleInstances + GADTs + MultiParamTypeClasses + Rank2Types + ScopedTypeVariables + TypeFamilies + TypeOperators + UndecidableInstances + + build-depends: + base >= 4 && < 4.6, + containers >= 0.3 && < 0.5, + mtl >= 2.1 && < 2.2, + transformers >= 0.3 && < 0.4, + bifunctors >= 0.1.3 && < 0.2, + comonad >= 1.1.1.3 && < 1.2, + distributive >= 0.2.1 && < 0.3, + semigroups >= 0.8.2 && < 0.9, + semigroupoids >= 1.3 && < 1.4, + keys >= 2.1.3 && < 2.2, + comonad-transformers >= 2.1 && < 2.2, + adjunctions >= 2.2 && < 2.3, + representable-functors >= 2.2 && < 2.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