package coq-lsp

You can search for identifiers within the package.

in-package search v0.2.0

package coq-lsp

coq-lsp.coq
- Coq
  - Ast
  - Goals
  - Init
  - Interp
    
    Info
  - Loader
  - Message
  - Parsing
    
    Parsable
  - Print
  - Protect
    
    E
    
    Error
    
    R
  - State
    
    Proof
  - Workspace
    
    CmdLine
coq-lsp.fleche
- Fleche
  - Config
    
    Unicode_completion
  - Coq_utils
  - Debug
  - Doc
    
    Completion
    
    Contents
    
    Node
    
    Info
    
    Message
    
    Target
  - Info
    
    LC
    
    LineCol
    
    O
    
    Offset
    
    Point
    
    S
    
    P
  - Io
    
    CallBack
    
    Log
    
    Report
  - Memo
    
    CacheStats
    
    Stats
  - Progress
    
    Info
  - Stats
    
    Kind
  - Types
    
    Diagnostic
    
    Extra
    
    Point
    
    Range
  - Utf8
coq-lsp.lsp
- Lsp
  - Base
    
    Message
    
    VersionedTextDocument
  - Io
    
    TraceValue
  - JCoq
    
    Goals
    
    Pp
  - JFleche
    
    CompletionData
    
    Config
    
    GoalsAnswer
    
    HoverContents
    
    HoverInfo
    
    LabelDetails
    
    Location
    
    SymInfo
    
    TextEditReplace
    
    Types
    
    Point
    
    Range

Legend:
Library
Module
Module type
Parameter
Class
Class type

type 'a hyp = {

names : string list;
(*
This will become Names.Id.t list in 0.2.0
*)
def : 'a option;
ty : 'a;

}

type info = {

evar : Evar.t;
name : Names.Id.t option;

}

type 'a reified_goal = {

info : info;
ty : 'a;
hyps : 'a hyp list;

}

val map_reified_goal : f:('a -> 'b) -> 'a reified_goal -> 'b reified_goal

type 'a goals = {

goals : 'a list;
stack : ('a list * 'a list) list;
bullet : Pp.t option;
shelf : 'a list;
given_up : 'a list;

}

val map_goals : f:('a -> 'b) -> 'a goals -> 'b goals

type reified_pp = Pp.t reified_goal goals

val reify : 
  ppx:(Environ.env -> Evd.evar_map -> EConstr.t -> 'a) ->
  State.Proof.t ->
  'a reified_goal goals

Stm-independent goal processor