# bound: Making de Bruijn Succ Less

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, 1.0.5, 1.0.6, 1.0.7, 2, 2.0.1 |
---|---|

Change log | CHANGELOG.markdown |

Dependencies | base (==4.*), bifunctors (==3.0.*), comonad (==3.0.*), ghc‑prim, prelude‑extras (==0.2.*), transformers (>=0.2 && <0.4) [details] |

License | BSD-3-Clause |

Copyright | Copyright (C) 2012 Edward A. Kmett |

Author | Edward A. Kmett |

Maintainer | Edward A. Kmett <ekmett@gmail.com> |

Category | Language, Compilers/Interpreters |

Home page | http://github.com/ekmett/bound/ |

Bug tracker | http://github.com/ekmett/bound/issues |

Source repo | head: git clone git://github.com/ekmett/bound.git |

Uploaded | by EdwardKmett at Thu Sep 13 20:40:21 UTC 2012 |

Distributions | LTSHaskell:2.0.1, NixOS:2.0.1, Stackage:2.0.1, openSUSE:2.0.1 |

Downloads | 14003 total (109 in the last 30 days) |

Rating | 2.5 (votes: 4) [estimated by rule of succession] |

Your Rating | |

Status | Docs uploaded by user Build status unknown [no reports yet] Hackage Matrix CI |

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:

http://www.slideshare.net/ekmett/bound-making-de-bruijn-succ-less

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.

[Skip to Readme]

## Downloads

- bound-0.5.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)