bound-0.1: Combinators for manipulating locally-nameless generalized de Bruijn terms

Portabilityportable
Stabilityexperimental
MaintainerEdward Kmett <ekmett@gmail.com>
Safe HaskellSafe-Infered

Bound.Term

Description

 

Synopsis

Documentation

substitute :: (Monad f, Eq a) => f a -> a -> f a -> f aSource

substitute p a w replaces the free variable a with p in w

closed :: Traversable f => f a -> Maybe (f b)Source

If a term has no free variables, you can freely change the type of free variables it uses