The bound package

[Tags: bsd3, library]

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.


Versions0.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.1, 0.6, 0.6.1, 0.7, 0.8, 0.8.1, 0.9,, 0.9.1,, 1.0, 1.0.1, 1.0.2, 1.0.3
Dependenciesbase (==4.*), bifunctors (>=3), comonad (>=3), prelude-extras (>=0.2), transformers (>=0.2 && <0.4)
CopyrightCopyright (C) 2012 Edward A. Kmett
AuthorEdward A. Kmett
MaintainerEdward A. Kmett <>
CategoryLanguage, Compilers/Interpreters
Home page
Bug tracker
Source repositoryhead: git clone git://
Upload dateSun Jan 6 23:58:06 UTC 2013
Uploaded byEdwardKmett
Downloads3080 total (150 in last 30 days)




Maintainers' corner

For package maintainers and hackage trustees