package bap-core-theory

You can search for identifiers within the package.

in-package search v0.2.0

bap-core-theory
- Bap_core_theory
  - Theory
    
    Basic
    
    Empty
    
    Make
    
    S
    
    Bitv
    
    Bool
    
    Core
    
    Documentation
    
    Theory
    
    Effect
    
    Sort
    
    Empty
    
    Fbasic
    
    Float
    
    Format
    
    IEEE754
    
    Sort
    
    Init
    
    Label
    
    Mem
    
    Memory
    
    Minimal
    
    Parser
    
    Grammar
    
    Bitv
    
    Bool
    
    Float
    
    Mem
    
    Rmode
    
    Stmt
    
    Make
    
    S
    
    Program
    
    Semantics
    
    Rmode
    
    Trans
    
    Value
    
    Sort
    
    Name
    
    Top
    
    Var
    
    Ident
    
    Top

Legend:
Library
Module
Module type
Parameter
Class
Class type

The semantics of programs.

The semantics of a program is denoted with effects that this program produces, so effectively Program.Semantics = Effect, but we reexport it in a separate module here, to separate the concerns.

type cls = Effect.cls

type t = unit Effect.t

val cls : (cls, unit Effect.sort) Bap_knowledge.Knowledge.cls

the class of program semantics values.

val slot : (program, t) Bap_knowledge.Knowledge.slot

the slot to store program semantics.

include Bap_knowledge.Knowledge.Value.S with type t := t

include Ppx_sexp_conv_lib.Sexpable.S with type t := t

val t_of_sexp : Sexplib0.Sexp.t -> t

val sexp_of_t : t -> Sexplib0.Sexp.t

val empty : t

val domain : t Bap_knowledge.Knowledge.domain

include Base.Comparable.S with type t := t

include Base.Comparisons.S with type t := t

include Base.Comparisons.Infix with type t := t

val (>=) : t -> t -> bool

val (<=) : t -> t -> bool

val (=) : t -> t -> bool

val (>) : t -> t -> bool

val (<) : t -> t -> bool

val (<>) : t -> t -> bool

val equal : t -> t -> bool

val compare : t -> t -> int

compare t1 t2 returns 0 if t1 is equal to t2, a negative integer if t1 is less than t2, and a positive integer if t1 is greater than t2.

val min : t -> t -> t

val max : t -> t -> t

val ascending : t -> t -> int

ascending is identical to compare. descending x y = ascending y x. These are intended to be mnemonic when used like List.sort ~compare:ascending and List.sort ~cmp:descending, since they cause the list to be sorted in ascending or descending order, respectively.

val descending : t -> t -> int

val between : t -> low:t -> high:t -> bool

between t ~low ~high means low <= t <= high

val clamp_exn : t -> min:t -> max:t -> t

clamp_exn t ~min ~max returns t', the closest value to t such that between t' ~low:min ~high:max is true.

Raises if not (min <= max).

val clamp : t -> min:t -> max:t -> t Base.Or_error.t

include Base.Comparator.S with type t := t

type comparator_witness

val comparator : (t, comparator_witness) Base.Comparator.comparator

val validate_lbound : min:t Base.Maybe_bound.t -> t Base.Validate.check

val validate_ubound : max:t Base.Maybe_bound.t -> t Base.Validate.check

val validate_bound : 
  min:t Base.Maybe_bound.t ->
  max:t Base.Maybe_bound.t ->
  t Base.Validate.check

include Core_kernel.Binable.S with type t := t

include Bin_prot.Binable.S_only_functions with type t := t

val bin_size_t : t Bin_prot.Size.sizer

val bin_write_t : t Bin_prot.Write.writer

val bin_read_t : t Bin_prot.Read.reader

val __bin_read_t__ : (int -> t) Bin_prot.Read.reader

This function only needs implementation if t exposed to be a polymorphic variant. Despite what the type reads, this does *not* produce a function after reading; instead it takes the constructor tag (int) before reading and reads the rest of the variant t afterwards.

val bin_shape_t : Bin_prot.Shape.t

val bin_writer_t : t Bin_prot.Type_class.writer

val bin_reader_t : t Bin_prot.Type_class.reader

val bin_t : t Bin_prot.Type_class.t