homepage: https://github.com/aspiwack/peppermint-prover
changelog-type: markdown
hash: 92a1290568611c758abbc97c77452150ebfbf345d5fb60366cf09363133694a0
test-bench-deps: {}
maintainer: arnaud@spiwack.net
synopsis: Unfixing and recursion schemes for data types with binders
changelog: ! '# Revision history for unfix-binders


  ## 0.1.0 -- 2017-10-10


  * Bare minimum library, unstable API, for demonstration only

'
basic-deps:
  base: ! '>=4.12 && <4.13'
all-versions:
- '0.1.0'
author: Arnaud Spiwack
latest: '0.1.0'
description-type: markdown
description: ! 'Unfix binders

  =============


  _when your substitutions are in a fix_


  This library defines fixed points of endofunctors of the category of

  endofunctors with the purpose of generalising recursion schemes for

  data types with binders.


  It is still in a very experimental state: for demonstration purpose only (though
  contributions welcome!)

'
license-name: BSD3

Update from Hackage at 2018-10-11T09:17:21Z
Update from Hackage at 2018-10-11T09:17:21Z
