term-rewriting-0.3: Term Rewriting Library

Safe HaskellNone
LanguageHaskell98

Data.Rewriting.Rule

Contents

Synopsis

Documentation

data Rule f v Source #

Rewrite rule with left-hand side and right-hand side.

Constructors

Rule 

Fields

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

Defined in Data.Rewriting.Rule.Type

Methods

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

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

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

Defined in Data.Rewriting.Rule.Type

Methods

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

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

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

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

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

max :: Rule f v -> Rule f v -> Rule f v #

min :: Rule f v -> Rule f v -> Rule f v #

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

Defined in Data.Rewriting.Rule.Type

Methods

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

show :: Rule f v -> String #

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

(Pretty f, Pretty v) => Pretty (Rule f v) # 
Instance details

Defined in Data.Rewriting.Rule.Pretty

Methods

pretty :: Rule f v -> Doc #

prettyList :: [Rule f v] -> Doc #

Reexported modules