FiniteLattice(S, p)

logic.spad line 1925 [edit on github]

• S : SetCategory
• p : FiniteBiCPO(S)

This is the algebration of poset. A big difference between this lattice domain and the poset domain is that, in this domain, the REP holds a single node whereas in poset REP holds the whole poset. Date Created: Aug 2015

/\ : (%, %) -> %

from MeetSemilattice

= : (%, %) -> Boolean

from BasicType

\/ : (%, %) -> %

from JoinSemilattice

coerce : % -> OutputForm

from CoercibleTo(OutputForm)

convert : % -> InputForm

from ConvertibleTo(InputForm)

enumerate : () -> List(%)

from Finite

finiteLattice : S -> %

construct finite lattice element from object

finiteLattice : NonNegativeInteger -> %

construct finite lattice element from index

hash : % -> SingleInteger

from Hashable

hashUpdate! : (HashState, %) -> HashState

from Hashable

index : PositiveInteger -> %

from Finite

latex : % -> String

from SetCategory

lookup : % -> PositiveInteger

from Finite

random : () -> %

from Finite

size : () -> NonNegativeInteger

from Finite

smaller? : (%, %) -> Boolean

from Comparable

~= : (%, %) -> Boolean

from BasicType

Hashable

Finite

ConvertibleTo(InputForm)

CoercibleTo(OutputForm)

Comparable

SetCategory

Lattice

MeetSemilattice

BasicType

JoinSemilattice