zabt-0.3.0.0: Arity-typed abstract binding trees

Safe HaskellNone
LanguageHaskell2010

Zabt.Visits

Synopsis

Documentation

class Visits t where Source #

A type f :: Arity -> * instantiating Visits f essentially is Traversable, but we define a new typeclass to handle the difference in types.

Minimal complete definition

visit

Methods

visit :: Applicative f => (forall a. x a -> f (y a)) -> t x -> f (t y) Source #

vmap :: (forall a. x a -> y a) -> t x -> t y Source #

vfoldMap :: Monoid m => (forall a. x a -> m) -> t x -> m Source #