homepage: https://github.com/anton-k/data-fix
changelog-type: ''
hash: d8edf00817e386e0ef6bbb5d2ab75aac4e52e77e95c4ce3c08c0c9c028af3963
test-bench-deps: {}
maintainer: <anton.kholomiov@gmail.com>
synopsis: Fixpoint data types
changelog: ''
basic-deps:
  base: ! '>=4.7 && <5'
all-versions:
- 0.0.1
- 0.0.2
- 0.0.3
- 0.0.4
- 0.0.6
- 0.0.7
- 0.2.0
author: Anton Kholomiov
latest: 0.2.0
description-type: haddock
description: ! 'Fixpoint types and recursion schemes. If you define your AST as

  fixpoint type, you get fold and unfold operations for free.


  Thanks for contribution to: Matej Kollar, Herbert Valerio Riedel'
license-name: BSD-3-Clause

homepage: https://github.com/anton-k/data-fix
changelog-type: ''
hash: 0d7c66c471617810dde4ca2f8ff1441f50b50d649c49eee3570f293435b636d1
test-bench-deps: {}
maintainer: <anton.kholomiov@gmail.com>
synopsis: Fixpoint data types
changelog: ''
basic-deps:
  base: '>=4.7 && <5'
all-versions:
- 0.0.1
- 0.0.2
- 0.0.3
- 0.0.4
- 0.0.6
- 0.0.7
- 0.2.0
- 0.2.1
author: Anton Kholomiov
latest: 0.2.1
description-type: haddock
description: |-
  Fixpoint types and recursion schemes. If you define your AST as
  fixpoint type, you get fold and unfold operations for free.

  Thanks for contribution to: Matej Kollar, Herbert Valerio Riedel
license-name: BSD-3-Clause

Update from Hackage at 2020-04-07T19:41:56Z
Update from Hackage at 2020-04-07T19:41:56Z
