Skip to content
Combinators for manipulating locally-nameless generalized de Bruijn terms
Haskell Shell
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
doc Regenerate .travis.yml May 1, 2019
examples Upgrade multi-ghc-travis setup Jan 15, 2018
src Fix typo in Bound.TH Dec 17, 2017
tests
travis
.ghci Added Bound.TH and Template Haskell flag. Oct 3, 2015
.gitignore Upgrade multi-ghc-travis setup Jan 15, 2018
.travis.yml Travis: Work around haskell/cabal#6214 Aug 31, 2019
.vim.custom tags Sep 13, 2012
AUTHORS.markdown
CHANGELOG.markdown
LICENSE repository initialized Jun 14, 2012
README.markdown Changed readme example to use deriving-compat Sep 16, 2016
Setup.lhs Fix #62, Don't use Warning module Jun 11, 2017
bound.cabal Allow hashable-1.3.* May 10, 2019
cabal.haskell-ci
cabal.project Upgrade multi-ghc-travis setup Jan 15, 2018

README.markdown

Bound

Hackage Build Status

Goals

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 #-}
{-# LANGUAGE TemplateHaskell #-}

import Bound
import Control.Applicative
import Control.Monad
import Data.Functor.Classes
import Data.Foldable
import Data.Traversable
import Data.Eq.Deriving (deriveEq1)      -- these two are from the
import Text.Show.Deriving (deriveShow1)  -- deriving-compat package

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

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

deriveEq1 ''Exp
deriveShow1 ''Exp

main :: IO ()
main = do
  let term = lam 'x' (V 'x') :@ V 'y'
  print term         -- Lam (Scope (V (B ()))) :@ V 'y'
  print $ whnf term  -- V 'y'

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 irc.freenode.net.

-Edward Kmett

You can’t perform that action at this time.