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
  - Rawdk
  - 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

module LSP = Lsp_base

val lp_logger : Stdlib.Buffer.t

type doc_node = {

ast : Pure.Command.t;
exec : bool;
goals : (Pure.goal list * Common.Pos.popt) list;

}

type t = {

uri : string;
version : int;
text : string;
mutable root : Pure.state option;
mutable final : Pure.state option;
nodes : doc_node list;
logs : ((int * string) * Common.Pos.popt) list;
map : Core.Term.qident Lplib.RangeMap.t;

}

val option_default : 'a option -> 'a -> 'a

val mk_error : doc:t -> Common.Pos.pos -> string -> LSP.J.t

val buf_get_and_clear : Stdlib.Buffer.t -> string

val process_pstep : 
  (Pure.proof_state
   * (Common.Pos.popt * int * string * Pure.goal list option) list
   * ((int * string) * Common.Pos.popt) list) ->
  Pure.Tactic.t ->
  int ->
  Pure.proof_state
  * (Common.Pos.popt * int * string * Pure.goal list option) list
  * ((int * string) * Common.Pos.popt) list

val process_proof : 
  Pure.proof_state ->
  Pure.ProofTree.t ->
  ((int * string) * Common.Pos.popt) list ->
  Pure.proof_state
  * (Common.Pos.popt * int * string * Pure.goal list option) list
  * ((int * string) * Common.Pos.popt) list

val get_goals : ('a * 'b * 'c * 'd list option) list -> ('d list * 'a) list

val process_cmd : 
  'a ->
  (doc_node list
   * Pure.state
   * (Common.Pos.popt * int * string * Pure.goal list option) list
   * ((int * string) * Common.Pos.popt) list) ->
  Pure.Command.t ->
  doc_node list
  * Pure.state
  * (Common.Pos.popt * int * string * Pure.goal list option) list
  * ((int * string) * Common.Pos.popt) list

val new_doc : uri:string -> version:int -> text:string -> t

val close_doc : 'a -> unit

val dummy_loc : Common.Pos.pos Stdlib.Lazy.t

val check_text : doc:t -> t * LSP.J.t