term-rewriting-0.3: Term Rewriting Library

Safe HaskellSafe
LanguageHaskell98

Data.Rewriting.Context

Contents

Synopsis

Documentation

data Ctxt f v Source #

Instances
(Eq f, Eq v) => Eq (Ctxt f v) Source # 
Instance details

Defined in Data.Rewriting.Context.Type

Methods

(==) :: Ctxt f v -> Ctxt f v -> Bool #

(/=) :: Ctxt f v -> Ctxt f v -> Bool #

(Ord f, Ord v) => Ord (Ctxt f v) Source # 
Instance details

Defined in Data.Rewriting.Context.Type

Methods

compare :: Ctxt f v -> Ctxt f v -> Ordering #

(<) :: Ctxt f v -> Ctxt f v -> Bool #

(<=) :: Ctxt f v -> Ctxt f v -> Bool #

(>) :: Ctxt f v -> Ctxt f v -> Bool #

(>=) :: Ctxt f v -> Ctxt f v -> Bool #

max :: Ctxt f v -> Ctxt f v -> Ctxt f v #

min :: Ctxt f v -> Ctxt f v -> Ctxt f v #

(Show f, Show v) => Show (Ctxt f v) Source # 
Instance details

Defined in Data.Rewriting.Context.Type

Methods

showsPrec :: Int -> Ctxt f v -> ShowS #

show :: Ctxt f v -> String #

showList :: [Ctxt f v] -> ShowS #

Important operations

ofTerm :: Term f v -> Pos -> Maybe (Ctxt f v) Source #

Create a context from a term by placing the hole at a specific position.

apply :: Ctxt f v -> Term f v -> Term f v Source #

Apply a context to a term (i.e., replace the hole in the context by the term).

Reexported modules