package lambdapi

You can search for identifiers within the package.

in-package search v0.2.0

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

Handling of queries.

val infer : 
  Common.Pos.popt ->
  Core.Term.problem ->
  Core.Term.ctxt ->
  Core.Term.term ->
  Core.Term.term * Core.Term.term

infer pos p c t returns a couple (t',a) where a is the type of t in context c and under constraints of problem p; and t' is the refinement of t. Note that p gets modified. Context c must well sorted.

raises Fatal
if t cannot be typed.

val check : 
  Common.Pos.popt ->
  Core.Term.problem ->
  Core.Term.ctxt ->
  Core.Term.term ->
  Core.Term.term ->
  Core.Term.term

check pos p c t a checks that the term t has type a in context c and under the constraints of p, and returns t refined. Context c must be well-sorted. Note that p is modified.

raises Fatal
if t is not of type a.

val check_sort : 
  Common.Pos.popt ->
  Core.Term.problem ->
  Core.Term.ctxt ->
  Core.Term.term ->
  Core.Term.term * Core.Term.term

check_sort pos p c t checks that the term t has type Type or Kind in context c and under the constraints of p. Context c must be well sorted.

raises Fatal
if t cannot be typed by a sort (Type or Kind).

type result = (unit -> string) option

Result of query displayed on hover in the editor.

val handle : 
  Core.Sig_state.t ->
  Proof.proof_state option ->
  Parsing.Syntax.p_query ->
  result

handle_query ss ps q