unfix-binders: Unfixing and recursion schemes for data types with binders

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

Use fixed-point of endofunctors of endofunctors (that is initial algebras in the category of endofunctors) to define recursion schemes for data types with binders

[Skip to Readme]

Properties

Versions	0.1.0, 0.1.0
Change log	ChangeLog.md
Dependencies	base (>=4.12 && <4.13) [details]
License	BSD-3-Clause
Copyright	2018 Arnaud Spiwack
Author	Arnaud Spiwack
Maintainer	arnaud@spiwack.net
Category	Data
Home page	https://github.com/aspiwack/peppermint-prover
Uploaded	by aspiwack at 2018-10-11T09:03:21Z

Modules

[Index]

Data
- Binder
  - Data.Binder.Unfix

Downloads

unfix-binders-0.1.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

aspiwack

For package maintainers and hackage trustees

edit package information

Readme for unfix-binders-0.1.0

[back to package 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!)