homepage: http://github.com/mgsloan/th-reify-many
changelog-type: ''
hash: 260637b07bde789336239a0b14ff32e79c59fe67595a407a75cd6b370e371280
test-bench-deps:
  base: -any
  th-reify-many: -any
  template-haskell: -any
maintainer: Michael Sloan <mgsloan at gmail>
synopsis: Recurseively reify template haskell datatype info
changelog: ''
basic-deps:
  base: ! '>=4 && <5'
  containers: -any
  th-expand-syns: -any
  mtl: -any
  template-haskell: ! '>=2.5.0.0'
  safe: -any
all-versions:
- '0.1.1'
- '0.1.2'
- '0.1.3'
- '0.1.4'
- '0.1.4.1'
author: Michael Sloan
latest: '0.1.4.1'
description-type: haddock
description: ! '@th-reify-many@ provides functions for recursively reifying top

  level declarations.  The main intended use case is for enumerating

  the names of datatypes reachable from an initial datatype, and

  passing these names to some function which generates instances.'
license-name: BSD3

homepage: http://github.com/mgsloan/th-reify-many
changelog-type: ''
hash: 6a6273a34eb3be7f20d0aec2e91b0ee39e2fa1399d67b3de8ad082228d28ca23
test-bench-deps:
  base: -any
  th-reify-many: -any
  template-haskell: -any
maintainer: Michael Sloan <mgsloan at gmail>
synopsis: Recurseively reify template haskell datatype info
changelog: ''
basic-deps:
  base: ! '>=4 && <5'
  containers: -any
  th-expand-syns: -any
  mtl: -any
  template-haskell: ! '>=2.5.0.0'
  safe: -any
all-versions:
- '0.1.1'
- '0.1.2'
- '0.1.3'
- '0.1.4'
- '0.1.4.1'
- '0.1.5'
author: Michael Sloan
latest: '0.1.5'
description-type: haddock
description: ! '@th-reify-many@ provides functions for recursively reifying top

  level declarations.  The main intended use case is for enumerating

  the names of datatypes reachable from an initial datatype, and

  passing these names to some function which generates instances.'
license-name: BSD3

Update from Hackage at 2016-05-09T02:19:19+0000
Update from Hackage at 2016-05-09T02:19:19+0000
