package fix

You can search for identifiers within the package.

in-package search v0.2.0

package fix

fix
- Fix
  - ARRAY
  - CompactQueue
  - DATA_FLOW_GRAPH
  - DataFlow
    
    ForCustomMaps
    
    B
    
    G
    
    P
    
    V
    
    ForHashedType
    
    G
    
    P
    
    T
    
    ForIntSegment
    
    G
    
    K
    
    P
    
    ForOrderedType
    
    G
    
    P
    
    T
    
    ForType
    
    G
    
    P
    
    T
    
    Run
    
    G
    
    M
    
    P
  - FINITE_TYPE
  - Fix
    
    ForHashedType
    
    P
    
    T
    
    ForOrderedType
    
    P
    
    T
    
    ForType
    
    P
    
    T
    
    Make
    
    M
    
    P
  - GRAPH
  - Gensym
  - Glue
    
    ArraysAsImperativeMaps
    
    K
    
    CHAR
    
    HashTablesAsImperativeMaps
    
    H
    
    INT
    
    InjectHashedType
    
    I
    
    U
    
    InjectImperativeMaps
    
    I
    
    J
    
    M
    
    InjectMinimalImperativeMaps
    
    I
    
    M
    
    InjectOrderedType
    
    I
    
    U
    
    MinimalSemiLattice
    
    P
    
    PersistentMapsToImperativeMaps
    
    M
    
    STRING
    
    TrivialHashedType
    
    T
    
    TrivialOrderedType
    
    T
    
    WeakHashTablesAsImperativeMaps
    
    H
  - GraphNumbering
    
    ForHashedType
    
    G
    
    T
    
    ForOrderedType
    
    G
    
    T
    
    ForType
    
    G
    
    T
    
    Make
    
    G
    
    M
  - HashCons
    
    ForHashedType
    
    T
    
    ForHashedTypeWeak
    
    T
    
    Make
    
    M
    
    SERVICE
  - IMPERATIVE_MAPS
  - INJECTION
  - Indexing
    
    CARDINAL
    
    Const
    
    X
    
    Empty
    
    Gensym
    
    Index
    
    SUM
    
    Sum
    
    L
    
    R
    
    Vector
  - MEMOIZER
  - MINIMAL_IMPERATIVE_MAPS
  - MINIMAL_SEMI_LATTICE
  - Make
    
    M
    
    P
  - Memoize
    
    Char
    
    ForHashedType
    
    T
    
    ForOrderedType
    
    T
    
    ForType
    
    T
    
    Int
    
    Make
    
    M
    
    String
  - NUMBERING
  - Numbering
    
    ForHashedType
    
    Done
    
    T
    
    ForOrderedType
    
    Done
    
    T
    
    ForType
    
    Done
    
    T
    
    Make
    
    Done
    
    M
  - ONGOING_NUMBERING
  - PERSISTENT_MAPS
  - PROPERTY
  - Prop
    
    Boolean
    
    Option
    
    X
    
    Set
    
    X
  - SEMI_LATTICE
  - SOLUTION
  - SOLVER
  - TABULATOR
  - TWO_PHASE_NUMBERING
    
    Done
  - TYPE
  - Tabulate
    
    ForHashedType
    
    F
    
    T
    
    ForIntSegment
    
    K
    
    ForOrderedType
    
    F
    
    T
    
    ForType
    
    F
    
    Make
    
    F
    
    M

Legend:
Library
Module
Module type
Parameter
Class
Class type

The lattice of Booleans.

The Boolean lattice. The ordering is false <= true.

type property = bool

val bottom : property

val equal : property -> property -> bool

val is_maximal : property -> bool

val leq : bool -> bool -> bool

val join : bool -> bool -> bool

val leq_join : bool -> bool -> bool

leq_join p q must compute the join of p and q. If the result is logically equal to q, then q itself must be returned. Thus, we have leq_join p q == q if and only if leq p q holds.