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

Compute the inverse image of a term wrt an injective function.

val log : 'a Lplib.Base.outfmt -> 'a

val cache : (Term.sym -> 'a) -> Term.sym -> 'a

cache f s is equivalent to f s but f s is computed only once unless the rules of s are changed.

val const_graph : Term.sym -> (Term.sym * Term.sym) list

cached version of const_rules.

val inverse_const : Term.sym -> Term.sym -> Term.sym

inverse_const s s' returns s0 if s has a rule of the form s (s0 ...) ↪ s' ....

raises [Not_found]
otherwise.

val prod_graph : Term.sym -> (Term.sym * Term.sym * Term.sym * bool) list

cached version of prod_graph.

val inverse_prod : 
  Term.sym ->
  Term.sym ->
  Term.sym * Term.sym * Term.sym * bool

inverse_prod s s' returns (s0,s1,s2,b) if s has a rule of the form s (s0 _ _) ↪ Π x:s1 _, s2 r with b=true iff x occurs in r, and either s1 has a rule of the form s1 (s3 ...) ↪ s' ... or s1 == s'.

raises [Not_found]
otherwise.

val inverse : Term.sym -> Term.term -> Term.term