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.

[Skip to ReadMe]


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, 1.0.4, 1.0.5, 1.0.6, 1.0.7
Change logCHANGELOG.markdown
Dependenciesbase (==4.*), bifunctors (>=3 && <6), binary (>=0.5 && <0.8), bytes (>=0.4 && <1), cereal (>= && <0.6), comonad (>=3 && <5), ghc-prim, hashable (>=1.1 && <1.3), hashable-extras (>=0.1 && <1), prelude-extras (>=0.3 && <1), profunctors (>=3.3 && <6), template-haskell (>=2.7 && <3), transformers (>=0.2 && <0.5) [details]
CopyrightCopyright (C) 2012-2013 Edward A. Kmett
AuthorEdward A. Kmett
MaintainerEdward A. Kmett <>
CategoryLanguage, Compilers/Interpreters
Home page
Bug tracker
Source repositoryhead: git clone git://
UploadedFri Dec 18 21:18:12 UTC 2015 by EdwardKmett
DistributionsLTSHaskell:1.0.7, NixOS:1.0.7, Stackage:1.0.7
Downloads7252 total (135 in last 30 days)
3 []
StatusDocs available [build log]
Last success reported on 2015-12-18 [all 1 reports]




template-haskellYou can disable the use of the `template-haskell` package using `-f-template-haskell`. Disabling this is an unsupported configuration, but it may be useful for accelerating builds in sandboxes for expert users.EnabledManual

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainers' corner

For package maintainers and hackage trustees

Readme for bound-1.0.7


Hackage Build Status


This library provides convenient combinators for working with "locally-nameless" terms. These can be useful when writing a type checker, evaluator, parser, or pretty printer for terms that contain binders like forall or lambda, as they ease the task of avoiding variable capture and testing for alpha-equivalence.

See the documentation on hackage for more information, but here is an example:

{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE DeriveFoldable #-}
{-# LANGUAGE DeriveTraversable #-}
import Bound
import Prelude.Extras
import Control.Applicative
import Control.Monad
import Data.Foldable
import Data.Traversable

infixl 9 :@
data Exp a = V a | Exp a :@ Exp a | Lam (Scope () Exp a)
  deriving (Eq,Ord,Show,Read,Functor,Foldable,Traversable)

instance Eq1 Exp
instance Ord1 Exp
instance Show1 Exp
instance Read1 Exp
instance Applicative Exp where pure = V; (<*>) = ap

instance Monad Exp where
  return = V
  V a      >>= f = f a
  (x :@ y) >>= f = (x >>= f) :@ (y >>= f)
  Lam e    >>= f = Lam (e >>>= f)

lam :: Eq a => a -> Exp a -> Exp a
lam v b = Lam (abstract1 v b)

whnf :: Exp a -> Exp a
whnf (f :@ a) = case whnf f of
  Lam b -> whnf (instantiate1 a b)
  f'    -> f' :@ a
whnf e = e

There are longer examples in the examples/ folder.

Contact Information

Contributions and bug reports are welcome!

Please feel free to contact me through github or on the #haskell IRC channel on

-Edward Kmett