- The library provides convenient combinators for working with "locally-nameless" terms.
- With generalized de Bruijn term
- you can lift whole trees instead of just applying succ to individual variables.
- higher rank types isn't necessary by using a monad transformer.

- Useful for writing a AST of binders like forall or lambda.