The bound package
We represent the target language itself as an ideal monad supplied by the user, and provide a Scope monad transformer for introducing bound variables in user supplied terms. Users supply a Monad and Traversable instance, and we traverse to find free variables, and use the Monad to perform substitution that avoids bound variables.
Slides describing and motivating this approach to name binding are available online at:
The goal of this package is to make it as easy as possible to deal with name binding without forcing an awkward monadic style on the user.
With generalized de Bruijn term you can lift whole trees instead of just applying succ to individual variables, weakening the all variables bound by a scope and greatly speeding up instantiation. By giving binders more structure we permit easy simultaneous substitution and further speed up instantiation.
|Versions||0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2, 0.2.1, 0.3.1, 0.3.2, 0.4, 0.5, 0.5.0.1, 0.5.0.2, 0.5.1, 0.6, 0.6.1, 0.7, 0.8, 0.8.1, 0.9, 0.9.0.1, 0.9.1, 0.9.1.1, 1.0, 1.0.1, 1.0.2, 1.0.3, 1.0.4|
|Dependencies||base (==4.*), bifunctors (==3.0.*), comonad (==3.0.*), ghc-prim, prelude-extras (==0.2.*), transformers (>=0.2 && <0.4)|
|Copyright||Copyright (C) 2012 Edward A. Kmett|
|Author||Edward A. Kmett|
|Maintainer||Edward A. Kmett <email@example.com>|
|Source repository||head: git clone git://github.com/ekmett/bound.git|
|Uploaded||Thu Sep 13 20:40:21 UTC 2012 by EdwardKmett|
|Distributions||LTSHaskell:1.0.4, NixOS:1.0.4, Stackage:1.0.4|
|Downloads||4546 total (275 in last 30 days)|
|Status||Docs uploaded by user|
Build status unknown [no reports yet]
For package maintainers and hackage trustees