twee-0.1: An equational theorem prover

Safe HaskellNone
LanguageHaskell2010

Twee.Index

Documentation

data Index a Source #

Constructors

Index 

Fields

Singleton 

Fields

Nil 

Instances

Show a => Show (Index a) Source # 

Methods

showsPrec :: Int -> Index a -> ShowS #

show :: Index a -> String #

showList :: [Index a] -> ShowS #

Default (Index a) Source # 

Methods

def :: Index a Source #

data Entry a Source #

Constructors

Entry 

Fields

Instances

Eq a => Eq (Entry a) Source # 

Methods

(==) :: Entry a -> Entry a -> Bool #

(/=) :: Entry a -> Entry a -> Bool #

Show a => Show (Entry a) Source # 

Methods

showsPrec :: Int -> Entry a -> ShowS #

show :: Entry a -> String #

showList :: [Entry a] -> ShowS #

insert :: Symbolic a => a -> Index a -> Index a Source #

delete :: (Eq a, Symbolic a) => a -> Index a -> Index a Source #

elem :: (Eq a, Symbolic a) => a -> Index a -> Bool Source #

data Match a Source #

Constructors

Match 

Fields

newtype Frozen a Source #

Constructors

Frozen 

Fields

lookup :: Symbolic a => TermOf a -> Frozen a -> [a] Source #

matches :: TermOf a -> Frozen a -> [Match a] Source #

find :: TermListOf a -> Index a -> [Match a] -> [Match a] Source #

elems :: Index a -> [a] Source #

map :: ConstantOf a ~ ConstantOf b => (a -> b) -> Frozen a -> Frozen b Source #

filter :: (a -> Bool) -> Frozen a -> Frozen a Source #

union :: Frozen a -> Frozen a -> Frozen a Source #