Data.Rewriting.Problem.Type

Documentation

data StartTerms

Constructors

AllTerms

BasicTerms

Instances

Eq StartTerms

Defined in Data.Rewriting.Problem.Type

Methods

(==) :: StartTerms -> StartTerms -> Bool

(/=) :: StartTerms -> StartTerms -> Bool

Show StartTerms

Defined in Data.Rewriting.Problem.Type

Methods

showsPrec :: Int -> StartTerms -> ShowS

show :: StartTerms -> String

showList :: [StartTerms] -> ShowS

data Strategy

Constructors

Innermost

Full

Outermost

Instances

Eq Strategy

Defined in Data.Rewriting.Problem.Type

Methods

(==) :: Strategy -> Strategy -> Bool

(/=) :: Strategy -> Strategy -> Bool

Show Strategy

Defined in Data.Rewriting.Problem.Type

Methods

showsPrec :: Int -> Strategy -> ShowS

show :: Strategy -> String

showList :: [Strategy] -> ShowS

data RulesPair f v

Constructors

RulesPair

Fields

• strictRules :: [Rule f v]
• weakRules :: [Rule f v]

Instances

(Eq v, Eq f) => Eq (RulesPair f v)

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)

Defined in Data.Rewriting.Problem.Type

Methods

showsPrec :: Int -> RulesPair f v -> ShowS

show :: RulesPair f v -> String

showList :: [RulesPair f v] -> ShowS

data Problem f v

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)

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)

Defined in Data.Rewriting.Problem.Pretty

Methods

pretty :: Problem f v -> Doc

prettyList :: [Problem f v] -> Doc

data Theory f v

Constructors

SymbolProperty String [f]

Equations [Rule f v]

Instances

(Eq f, Eq v) => Eq (Theory f v)

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)

Defined in Data.Rewriting.Problem.Type

Methods

showsPrec :: Int -> Theory f v -> ShowS

show :: Theory f v -> String

showList :: [Theory f v] -> ShowS

allRules :: RulesPair f v -> [Rule f v]

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