Language.Symantic.Lib.Eq

Symantic for Eq.

Class Sym_Eq

class Sym_Eq term where

Methods

(==) :: Eq a => term a -> term a -> term Bool infix 4

(/=) :: Eq a => term a -> term a -> term Bool infix 4

(==) :: Sym_Eq (UnT term) => Trans term => Eq a => term a -> term a -> term Bool infix 4

(/=) :: Sym_Eq (UnT term) => Trans term => Eq a => term a -> term a -> term Bool infix 4

Instances

Sym_Eq View

Methods

(==) :: Eq a => View a -> View a -> View Bool

(/=) :: Eq a => View a -> View a -> View Bool

Sym_Eq Eval

Methods

(==) :: Eq a => Eval a -> Eval a -> Eval Bool

(/=) :: Eq a => Eval a -> Eval a -> Eval Bool

(Sym_Eq term, Sym_Lambda term) => Sym_Eq (BetaT term)

Methods

(==) :: Eq a => BetaT term a -> BetaT term a -> BetaT term Bool

(/=) :: Eq a => BetaT term a -> BetaT term a -> BetaT term Bool

(Sym_Eq r1, Sym_Eq r2) => Sym_Eq (Dup r1 r2)

Methods

(==) :: Eq a => Dup r1 r2 a -> Dup r1 r2 a -> Dup r1 r2 Bool

(/=) :: Eq a => Dup r1 r2 a -> Dup r1 r2 a -> Dup r1 r2 Bool

Types

tyEq :: Source src => Type src vs a -> Type src vs (Eq a)

Terms

teEq_eq :: TermDef Eq '[Proxy a] (Eq a #> (a -> a -> Bool))

teEq_ne :: TermDef Eq '[Proxy a] (Eq a #> (a -> a -> Bool))

Orphan instances

ClassInstancesFor (* -> Constraint) Eq

Methods

proveConstraintFor :: Source src => proxy c -> Type Constraint src vs q -> Maybe (Qual q)

TypeInstancesFor (* -> Constraint) Eq

Methods

expandFamFor :: Source src => proxy c -> Len Type vs -> Const kt src fam -> Types src vs ts -> Maybe (Type kt src vs (Fam kt fam ts))

NameTyOf (* -> Constraint) Eq

Methods

nameTyOf :: proxy c -> Mod NameTy

isNameTyOp :: proxy c -> Bool

FixityOf (* -> Constraint) Eq

Methods

fixityOf :: proxy c -> Maybe Fixity

(Source src, SymInj (* -> Constraint) ss Eq) => ModuleFor (* -> Constraint) src ss Eq

Methods

moduleFor :: (PathMod, Module ss Eq)

Gram_Term_AtomsFor (* -> Constraint) src ss g Eq

Methods

g_term_atomsFor :: [CF Eq (AST_Term ss g)]