Safe Haskell	None
Language	Haskell98

Data.Rewriting.Problem.Type

Documentation

Constructors

AllTerms
BasicTerms

Instances

Eq StartTerms Source #
Instance details Defined in Data.Rewriting.Problem.Type Methods (==) :: StartTerms -> StartTerms -> Bool # (/=) :: StartTerms -> StartTerms -> Bool #
Show StartTerms Source #
Instance details Defined in Data.Rewriting.Problem.Type Methods showsPrec :: Int -> StartTerms -> ShowS # show :: StartTerms -> String # showList :: [StartTerms] -> ShowS #

Constructors

Instances

Eq Strategy Source #
Instance details Defined in Data.Rewriting.Problem.Type Methods (==) :: Strategy -> Strategy -> Bool # (/=) :: Strategy -> Strategy -> Bool #
Show Strategy Source #
Instance details Defined in Data.Rewriting.Problem.Type Methods showsPrec :: Int -> Strategy -> ShowS # show :: Strategy -> String # showList :: [Strategy] -> ShowS #

Constructors

RulesPair
Fields strictRules :: [Rule f v] weakRules :: [Rule f v]

Instances

(Eq v, Eq f) => Eq (RulesPair f v) Source #
Instance details Defined in Data.Rewriting.Problem.Type Methods (==) :: RulesPair f v -> RulesPair f v -> Bool # (/=) :: RulesPair f v -> RulesPair f v -> Bool #
(Show v, Show f) => Show (RulesPair f v) Source #
Instance details Defined in Data.Rewriting.Problem.Type Methods showsPrec :: Int -> RulesPair f v -> ShowS # show :: RulesPair f v -> String # showList :: [RulesPair f v] -> ShowS #

Constructors

Problem
Fields startTerms :: StartTerms strategy :: Strategy theory :: Maybe [Theory f v] rules :: RulesPair f v variables :: [v] symbols :: [f] comment :: Maybe String

Instances

(Show v, Show f) => Show (Problem f v) Source #
Instance details Defined in Data.Rewriting.Problem.Type Methods showsPrec :: Int -> Problem f v -> ShowS # show :: Problem f v -> String # showList :: [Problem f v] -> ShowS #
(Eq f, Eq v, Pretty f, Pretty v) => Pretty (Problem f v) #
Instance details Defined in Data.Rewriting.Problem.Pretty Methods pretty :: Problem f v -> Doc # prettyList :: [Problem f v] -> Doc #

Constructors

SymbolProperty String [f]
Equations [Rule f v]

Instances

(Eq f, Eq v) => Eq (Theory f v) Source #
Instance details Defined in Data.Rewriting.Problem.Type Methods (==) :: Theory f v -> Theory f v -> Bool # (/=) :: Theory f v -> Theory f v -> Bool #
(Show f, Show v) => Show (Theory f v) Source #
Instance details Defined in Data.Rewriting.Problem.Type Methods showsPrec :: Int -> Theory f v -> ShowS # show :: Theory f v -> String # showList :: [Theory f v] -> ShowS #

map :: (f -> f') -> (v -> v') -> Problem f v -> Problem f' v' Source #