rebound

Make bound Succ more

Tools for working with traversal-based Bird/Paterson-style De Bruijn-indices, with zero non-base dependencies.

Conceptually, this package is very similar to bound's Bound.Scope.Simple module, i.e. the non-monadic version, but with an API focused on general traversals. The simplest case where this is useful is when you have multiple variables/binders in the same expression data type. More generally, the API works with any representation you can generate the appropriate traversal for, which includes named representations, or nested scope transformers like bound itself.

As a rule of thumb, if your expression forms a monad, use bound, if not, you might be interested in this package instead.

The main API consists of

abstract1Over    :: ASetter   s t a (Bind1 a) -> a -> s -> t
abstractOver     :: ASetter   s t a (Bind b a) -> (a -> Maybe b) -> s -> t
instantiate1Over :: ASetter   s t (Bind1 a) a -> a -> s -> t
instantiateOver  :: ASetter   s t (Bind b a) a -> (b -> a) -> s -> t
closedOver       :: Traversal s t a b -> s -> Either (NonEmpty a) t
maybeClosedOver  :: Traversal s t a b -> s -> Maybe t
unusedOver       :: Traversal s t (Bind b a) a -> s -> Either (NonEmpty b) t
maybeUnusedOver  :: Traversal s t (Bind b a) a -> s -> Maybe t

where Bind is equivalent to bound's Var.

All of the functions in the above API have versions without the Over suffix, that work on Traversable elements, similar to bound.

The optics in this library are compatible with most Van Laarhoven-style optics libraries (lens, microlens, etc.).

Examples

Basic API

λ> abstract1Over (_Left . traverse) 'x' (Right 9)
Right 9
λ> abstract1Over (_Left . traverse) 'x' (Left "xyz")
Left [Bound1, Free 'y', Free 'z']

System F

data Expr t v
  = Var v
  | Lam (Type t) (Expr t (Bind () v))
  | App (Expr t v) (Expr t v)
  | TyLam (Expr (Bind () t) v)
  | TyApp (Expr t v) (Type t)

data Type t
  = TVar t
  | TArr (Type t) (Type t)
  | TForall (Type (Bind () t))
  deriving (Functor)

traverseExpr ::
  Applicative m =>
  (t -> m t') ->
  (v -> m v') ->
  (Expr t v -> m (Expr t' v'))
traverseExpr ft fv = error "exercise for the reader"

types :: Traversal (Expr t v) (Expr t' v) t t'
types f = traverseExpr f pure

vars :: Traversal (Expr t v) (Expr t v') v v'
vars f = traverseExpr pure f

lam :: Eq v => v -> Type t -> Expr t v -> Expr t v
lam v t = Lam t . abstract1Over vars v

tyLam :: Eq t => t -> Expr t v -> Expr t v
tyLam t = TyLam . abstract1Over types t

forall :: Eq t => t -> Type t -> Type t
forall t = TForall . abstract1 t

jonascarpay/rebound

rebound

Examples

Basic API

System F