Generics.Instant.Rewriting

Contents

• The class to signal availability of rewriting for a type
• Top-level functions
• Building rewrite rules
• Internal classes: might be necessary to add new base types
• Re-exported for convenience

Description

Synopsis

• class (Representable a, Typeable a, Eq a, Empty (Rep a), Extensible (Rep a), Matchable (Rep a), Substitutable (Rep a), Sampleable (Rep a), Diffable (Rep a), Validatable (Rep a)) => Rewritable a
• rewrite :: Rewritable a => Rule a -> a -> a
• rewriteM :: (Rewritable a, Monad m) => Rule a -> a -> m a
• validate :: Rewritable a => Rule a -> Bool
• synthesise :: (IsRule a, Nillable (Env a), Recordable (Env a), Testable (Env a), FiniteEnv (Env a) ~ True) => a -> Rule (Obj a)
• data Template a = Template a a Bool
• (+->) :: a -> a -> Template a
• (//) :: Template a -> Bool -> Template a
• data Rule a
• class Extensible a where
  • data Ext a :: * -> *
  • toExt :: a -> Ext a U
• class Matchable a where
  • match' :: (Nillable gam, Monad m) => Ext a gam -> a -> m (Subst gam)
• class Substitutable a where
  • subst' :: Monad m => Subst gam -> Ext a gam -> m a
• class Sampleable a where
  • left' :: a
  • right' :: a
• class Empty a where
  • empty' :: a
• class HasRec a where
  • hasRec' :: a -> Bool
• type family Finite a :: *
• data True
• data False
• class Diffable a where
  • diff' :: Typeable b => Ext a gam -> Ext a gam -> Maybe (Ext a (b :*: gam))
• class Validatable a where
  • record :: Ext a gam -> Record gam -> Record gam
• class Nillable gam where
  • empty :: Subst gam
• class Typeable a

The class to signal availability of rewriting for a type

Top-level functions

Building rewrite rules

Internal classes: might be necessary to add new base types

Re-exported for convenience