package lambdapi

You can search for identifiers within the package.

in-package search v0.2.0

package lambdapi

lambdapi.common
- Common
  - Console
    
    State
  - Debug
    
    D
  - Error
  - Escape
  - Library
    
    LibMap
  - Logger
  - Path
    
    Map
    
    Path
    
    Set
  - Pos
lambdapi.core
- Core
  - Builtin
  - Coercion
  - Ctxt
  - Env
  - Eval
  - Ghost
  - Infer
  - Inverse
  - LibMeta
  - LibTerm
  - Print
  - Sig_state
  - Sign
  - Term
    
    Raw
  - Tree
    
    CM
    
    CP
    
    PSet
  - Tree_type
    
    TC
    
    TCMap
  - Unif
  - Unif_rule
  - Version
lambdapi.export
- Export
  - Coq
    
    Qid
    
    QidMap
  - Dk
  - Hrs
    
    V
    
    VMap
  - Xtc
lambdapi.handle
- Handle
  - Command
  - Compile
    
    PureUpToSign
  - Fol
  - Inductive
  - Proof
    
    Goal
  - Query
  - Rewrite
  - Tactic
  - Why3_tactic
lambdapi.lplib
- Lplib
  - Array
  - Base
    
    Int
  - Bytes
  - Color
  - Extra
    
    IntMap
    
    IntSet
    
    StrMap
    
    StrSet
  - Filename
  - List
  - Option
    
    Applicative
    
    Monad
  - Range
  - RangeMap
    
    Make
    
    Range
    
    _
  - RangeMap_intf
    
    S
    
    Range
  - Range_intf
    
    S
  - String
  - Uchar
lambdapi.lsp
- Lsp
  - Lp_doc
  - Lp_lsp
  - Lsp_base
  - Lsp_io
lambdapi.parsing
- Parsing
  - DkBasic
    
    WS
  - DkLexer
  - DkParser
  - DkRule
  - DkTokens
  - LpLexer
  - LpParser
  - Package
  - Parser
    
    Dk
    
    Lp
    
    PARSER
  - Pratt
    
    Pratt
  - Pretty
  - Scope
  - SearchQuerySyntax
  - Syntax
    
    P
lambdapi.pure
- Pure
  - Command
  - ProofTree
  - Tactic
lambdapi.tool
- Tool
  - External
  - Indexing
  - Lcr
  - Sr
  - Tree_graphviz
  - Websearch

Legend:
Library
Module
Module type
Parameter
Class
Class type

Functional sets of integers.

type elt = Base.Int.t

type t = Stdlib__Set.Make(Lplib.Base.Int).t

val empty : t

val add : elt -> t -> t

val singleton : elt -> t

val remove : elt -> t -> t

val union : t -> t -> t

val inter : t -> t -> t

val disjoint : t -> t -> bool

val diff : t -> t -> t

val cardinal : t -> int

val elements : t -> elt list

val min_elt : t -> elt

val min_elt_opt : t -> elt option

val max_elt : t -> elt

val max_elt_opt : t -> elt option

val choose : t -> elt

val choose_opt : t -> elt option

val find : elt -> t -> elt

val find_opt : elt -> t -> elt option

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

val find_first_opt : (elt -> bool) -> t -> elt option

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

val find_last_opt : (elt -> bool) -> t -> elt option

val iter : (elt -> unit) -> t -> unit

val fold : (elt -> 'acc -> 'acc) -> t -> 'acc -> 'acc

val map : (elt -> elt) -> t -> t

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

val filter_map : (elt -> elt option) -> t -> t

val partition : (elt -> bool) -> t -> t * t

val split : elt -> t -> t * bool * t

val is_empty : t -> bool

val mem : elt -> t -> bool

val equal : t -> t -> bool

val compare : t -> t -> int

val subset : t -> t -> bool

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

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

val to_list : t -> elt list

val of_list : elt list -> t

val to_seq_from : elt -> t -> elt Stdlib.Seq.t

val to_seq : t -> elt Stdlib.Seq.t

val to_rev_seq : t -> elt Stdlib.Seq.t

val add_seq : elt Stdlib.Seq.t -> t -> t

val of_seq : elt Stdlib.Seq.t -> t