symantic-lib-0.0.3.20180213: Symantics for common types.

Safe HaskellNone
LanguageHaskell2010

Language.Symantic.Lib.Ord

Contents

Description

Symantic for Ord.

Synopsis

Class Sym_Ordering

Types

tyOrdering :: Source src => LenInj vs => Type src vs Ordering Source #

Terms

teOrdering :: Source src => SymInj ss Ordering => Ordering -> Term src ss ts '[] (() #> Ordering) Source #

Class Sym_Ord

class Sym_Eq term => Sym_Ord term where Source #

Methods

compare :: Ord a => term a -> term a -> term Ordering Source #

(<) :: Ord a => term a -> term a -> term Bool infix 4 Source #

(<=) :: Ord a => term a -> term a -> term Bool infix 4 Source #

(>) :: Ord a => term a -> term a -> term Bool infix 4 Source #

(>=) :: Ord a => term a -> term a -> term Bool infix 4 Source #

max :: Ord a => term a -> term a -> term a Source #

min :: Ord a => term a -> term a -> term a Source #

compare :: Sym_Ord (UnT term) => Trans term => Ord a => term a -> term a -> term Ordering Source #

(<) :: Sym_Ord (UnT term) => Trans term => Ord a => term a -> term a -> term Bool infix 4 Source #

(<=) :: Sym_Ord (UnT term) => Trans term => Ord a => term a -> term a -> term Bool infix 4 Source #

(>) :: Sym_Ord (UnT term) => Trans term => Ord a => term a -> term a -> term Bool infix 4 Source #

(>=) :: Sym_Ord (UnT term) => Trans term => Ord a => term a -> term a -> term Bool infix 4 Source #

max :: Sym_Ord (UnT term) => Trans term => Ord a => term a -> term a -> term a Source #

min :: Sym_Ord (UnT term) => Trans term => Ord a => term a -> term a -> term a Source #

Instances

Sym_Ord View Source # 

Methods

compare :: Ord a => View a -> View a -> View Ordering Source #

(<) :: Ord a => View a -> View a -> View Bool Source #

(<=) :: Ord a => View a -> View a -> View Bool Source #

(>) :: Ord a => View a -> View a -> View Bool Source #

(>=) :: Ord a => View a -> View a -> View Bool Source #

max :: Ord a => View a -> View a -> View a Source #

min :: Ord a => View a -> View a -> View a Source #

Sym_Ord Eval Source # 

Methods

compare :: Ord a => Eval a -> Eval a -> Eval Ordering Source #

(<) :: Ord a => Eval a -> Eval a -> Eval Bool Source #

(<=) :: Ord a => Eval a -> Eval a -> Eval Bool Source #

(>) :: Ord a => Eval a -> Eval a -> Eval Bool Source #

(>=) :: Ord a => Eval a -> Eval a -> Eval Bool Source #

max :: Ord a => Eval a -> Eval a -> Eval a Source #

min :: Ord a => Eval a -> Eval a -> Eval a Source #

(Sym_Ord term, Sym_Lambda term) => Sym_Ord (BetaT term) Source # 

Methods

compare :: Ord a => BetaT term a -> BetaT term a -> BetaT term Ordering Source #

(<) :: Ord a => BetaT term a -> BetaT term a -> BetaT term Bool Source #

(<=) :: Ord a => BetaT term a -> BetaT term a -> BetaT term Bool Source #

(>) :: Ord a => BetaT term a -> BetaT term a -> BetaT term Bool Source #

(>=) :: Ord a => BetaT term a -> BetaT term a -> BetaT term Bool Source #

max :: Ord a => BetaT term a -> BetaT term a -> BetaT term a Source #

min :: Ord a => BetaT term a -> BetaT term a -> BetaT term a Source #

(Sym_Ord r1, Sym_Ord r2) => Sym_Ord (Dup r1 r2) Source # 

Methods

compare :: Ord a => Dup r1 r2 a -> Dup r1 r2 a -> Dup r1 r2 Ordering Source #

(<) :: Ord a => Dup r1 r2 a -> Dup r1 r2 a -> Dup r1 r2 Bool Source #

(<=) :: Ord a => Dup r1 r2 a -> Dup r1 r2 a -> Dup r1 r2 Bool Source #

(>) :: Ord a => Dup r1 r2 a -> Dup r1 r2 a -> Dup r1 r2 Bool Source #

(>=) :: Ord a => Dup r1 r2 a -> Dup r1 r2 a -> Dup r1 r2 Bool Source #

max :: Ord a => Dup r1 r2 a -> Dup r1 r2 a -> Dup r1 r2 a Source #

min :: Ord a => Dup r1 r2 a -> Dup r1 r2 a -> Dup r1 r2 a Source #

Types

tyOrd :: Source src => Type src vs a -> Type src vs (Ord a) Source #

Terms

teOrd_compare :: TermDef Ord '[Proxy a] (Ord a #> (a -> a -> Ordering)) Source #

teOrd_le :: TermDef Ord '[Proxy a] (Ord a #> (a -> a -> Bool)) Source #

teOrd_lt :: TermDef Ord '[Proxy a] (Ord a #> (a -> a -> Bool)) Source #

teOrd_ge :: TermDef Ord '[Proxy a] (Ord a #> (a -> a -> Bool)) Source #

teOrd_gt :: TermDef Ord '[Proxy a] (Ord a #> (a -> a -> Bool)) Source #

teOrd_min :: TermDef Ord '[Proxy a] (Ord a #> (a -> a -> a)) Source #

teOrd_max :: TermDef Ord '[Proxy a] (Ord a #> (a -> a -> a)) Source #

Orphan instances

ClassInstancesFor * Ordering Source # 

Methods

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

TypeInstancesFor * Ordering Source # 

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 * Ordering Source # 

Methods

nameTyOf :: proxy c -> Mod NameTy #

isNameTyOp :: proxy c -> Bool #

(Source src, SymInj * ss Ordering) => ModuleFor * src ss Ordering Source # 
Gram_Term_AtomsFor * src ss g Ordering Source # 

Methods

g_term_atomsFor :: [CF Ordering (AST_Term ss g)] #

ClassInstancesFor (* -> Constraint) Ord Source # 

Methods

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

TypeInstancesFor (* -> Constraint) Ord Source # 

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) Ord Source # 

Methods

nameTyOf :: proxy c -> Mod NameTy #

isNameTyOp :: proxy c -> Bool #

FixityOf (* -> Constraint) Ord Source # 

Methods

fixityOf :: proxy c -> Maybe Fixity #

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

Methods

moduleFor :: (PathMod, Module ss Ord) #

Gram_Term_AtomsFor (* -> Constraint) src ss g Ord Source # 

Methods

g_term_atomsFor :: [CF Ord (AST_Term ss g)] #