twee-lib-2.3.1: An equational theorem prover
Safe HaskellNone
LanguageHaskell2010

Twee.KBO

Description

An implementation of Knuth-Bendix ordering.

Synopsis

Documentation

lessEq :: (Function f, Sized f, Weighted f) => Term f -> Term f -> Bool Source #

Check if one term is less than another in KBO.

lessIn :: (Function f, Sized f, Weighted f) => Model f -> Term f -> Term f -> Maybe Strictness Source #

Check if one term is less than another in a given model.

class Sized a where Source #

Methods

size :: a -> Integer Source #

Compute the size.

Instances

Instances details
(Labelled f, Sized f) => Sized (Fun f) Source # 
Instance details

Defined in Twee.KBO

Methods

size :: Fun f -> Integer Source #

(Labelled f, Sized f, Weighted f) => Sized (Term f) Source # 
Instance details

Defined in Twee.KBO

Methods

size :: Term f -> Integer Source #

(Labelled f, Sized f, Weighted f) => Sized (TermList f) Source # 
Instance details

Defined in Twee.KBO

Methods

size :: TermList f -> Integer Source #

(Labelled f, Sized f, Weighted f) => Sized (Equation f) Source # 
Instance details

Defined in Twee.KBO

Methods

size :: Equation f -> Integer Source #

class Weighted f where Source #

Methods

argWeight :: f -> Integer Source #

Instances

Instances details
(Weighted f, Labelled f) => Weighted (Fun f) Source # 
Instance details

Defined in Twee.KBO

Methods

argWeight :: Fun f -> Integer Source #