package logtk

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Pragmatic variant of JP algorithm

logtk
- Logtk
  - AllocCache
    
    Arr
  - Binder
    
    TPTP
    
    ZF
  - Builtin
    
    Arith
    
    ArithOp
    
    TPTP
    
    Tag
    
    ZF
  - Cnf
  - Comparison
    
    PARTIAL_ORD
  - Compute_prec
  - Congruence
    
    FO
    
    Make
    
    T
    
    TERM
  - Congruence_intf
    
    S
  - DBEnv
  - Defined_pos
    
    Arr
  - Dtree
    
    Default
    
    Make
    
    E
  - FV_tree
    
    Make
    
    C
    
    Feature_fun
  - FeatureVector
    
    Make
    
    C
    
    Feature
  - Fingerprint
    
    Make
    
    Leaf
  - FixpointUnif
  - Flex_state
  - HO_unif
  - HVar
  - Hash
  - Hashcons
    
    HashedType
    
    Make
    
    X
    
    MakeNonWeak
    
    X
    
    S
  - IArray
  - ID
    
    Map
    
    Set
    
    Tbl
  - Ind_ty
  - Index
    
    BasicEquation
    
    MakeLeaf
  - Index_intf
    
    CLAUSE
    
    EQUATION
    
    LEAF
    
    SUBSUMPTION_IDX
    
    C
    
    TERM_IDX
    
    Leaf
    
    UNIT_IDX
    
    E
  - InnerTerm
    
    DB
    
    Map
    
    Pos
    
    Seq
    
    Set
    
    Tbl
    
    VarMap
    
    VarSet
    
    VarTbl
  - Input_format
  - Int_lit
    
    Focus
    
    Seq
    
    Util
  - Interfaces
    
    EQ
    
    GROUP
    
    HASH
    
    ITER
    
    MONOID
    
    ORD
    
    PRINT
    
    PRINT1
    
    PRINT2
    
    PRINT3
    
    PRINT_DE_BRUIJN
    
    PRINT_OVERLOAD
  - JPFull
    
    Make
    
    S
  - JP_unif
    
    S
  - Lambda
    
    Inner
  - LazyList
  - Literal
    
    Comp
    
    Conv
    
    Pos
    
    Seq
    
    Set
    
    View
  - Literals
    
    Conv
    
    Pos
    
    Seq
    
    View
  - Monome
    
    Focus
    
    Int
    
    Modulo
    
    Solve
    
    Rat
    
    Seq
  - Multiset
    
    Make
    
    Seq
  - Multiset_intf
    
    S
    
    Seq
  - Multisets
    
    MMT
    
    Seq
    
    MT
    
    Seq
  - NPDtree
    
    Make
    
    E
    
    MakeTerm
    
    Leaf
  - Options
  - Ordering
  - Ordinal
  - Output_format
  - PUnif
    
    IntSet
    
    Make
    
    S
  - ParseLocation
    
    Infix
  - PatternUnif
    
    S
  - Position
    
    Build
    
    Map
    
    With
    
    Infix
  - PragUnifParams
  - Precedence
    
    Constr
    
    Seq
    
    Weight
    
    Infix
  - Proof
    
    Kind
    
    Parent
    
    Result
    
    Rule
    
    S
    
    Tbl
    
    Src
    
    Step
  - Rat_lit
    
    Focus
    
    Seq
  - Rewrite
    
    Defined_cst
    
    Lit
    
    Rule
    
    Rule
    
    Rule_set
    
    Term
    
    Rule
    
    Rule_inst_set
    
    Set
  - SLiteral
    
    TPTP
    
    ZF
  - STerm
    
    Map
    
    Seq
    
    Set
    
    StrMap
    
    StringSet
    
    TPTP
    
    TPTP_THF
    
    Tbl
    
    ZF
  - Scoped
  - Signal
  - Signature
    
    Seq
  - Skolem
  - SolidSubsumption
    
    Make
    
    S
  - SolidUnif
    
    Make
    
    S
  - Statement
    
    Seq
    
    TPTP
    
    ZF
  - Subst
    
    FO
    
    Projection
    
    Renaming
    
    SPECIALIZED
    
    Ty
  - Term
    
    AC
    
    A
    
    AC_SPEC
    
    Arith
    
    Classic
    
    Conv
    
    DB
    
    Form
    
    Map
    
    Pos
    
    Seq
    
    Set
    
    TPTP
    
    Tbl
    
    VarMap
    
    VarSet
    
    VarTbl
    
    ZF
  - Test_prop
  - Type
    
    Conv
    
    Map
    
    Seq
    
    Set
    
    TPTP
    
    Tbl
    
    VarMap
    
    VarSet
    
    VarTbl
    
    ZF
  - TypeInference
    
    Ctx
    
    TyBuiltin
  - TypedSTerm
    
    Form
    
    Seq
    
    Subst
    
    TPTP
    
    TPTP_THF
    
    Ty
    
    UStack
    
    Var_tbl
    
    ZF
  - Unif
    
    FO
    
    Inner
    
    Ty
  - UnifFramework
    
    Make
    
    X
    
    PARAMETERS
  - Unif_constr
    
    FO
  - Unif_intf
    
    S
  - Unif_subst
    
    FO
  - UnionFind
    
    Make
    
    P
    
    PAIR
  - UntypedAST
    
    A
  - Util
    
    Exn
    
    Flag
    
    Int_map
    
    Int_set
    
    Section
  - Var
    
    Set
    
    Subst
logtk.parsers
- Logtk_parsers
  - Ast_dk
  - Ast_tptp
  - CallProver
    
    Eprover
    
    Prover
  - Lex_dk
  - Lex_tptp
  - Lex_zf
  - Parse_dk
  - Parse_tptp
  - Parse_zf
  - Parsing_utils
  - Tip_ast
  - Tip_lexer
  - Tip_parser
  - Trace_tstp
  - Util_dk
  - Util_tip
  - Util_tptp
  - Util_zf
logtk.proofs
- Logtk_proofs
  - LLProof
    
    Dot
    
    Tbl
  - LLProof_check
  - LLProof_conv
  - LLProver
  - LLTerm
    
    Conv
    
    Form
    
    Int_op
    
    LINEXP
    
    Linexp_int
    
    Linexp_rat
    
    Rat_op
    
    Set
logtk.solving
- Logtk_solving
  - Lpo
    
    Constraint
    
    Seq
    
    FO
    
    Solution
    
    TypedSTerm

Legend:
Library
Module
Module type
Parameter
Class
Class type

Pragmatic variant of JP algorithm

Provides plug-in module for UnifFramework.ml that implements pragmatic restriction of the unification algorithm described in the paper Efficient Full Higher-Order Unification \urlhttp://matryoshka.gforge.inria.fr/pubs/hounif_paper.pdf

module IntSet : CCSet.S with type elt = CCInt.t

val elim_subsets_rule : 
  ?max_elims:int option ->
  elim_vars:IntSet.t Stdlib.ref ->
  counter:IntSet.elt Stdlib.ref ->
  scope:Scoped.scope ->
  Term.t ->
  Term.t ->
  int ->
  (Subst.FO.t * int) OSeq.t

val proj_hs : 
  counter:int Stdlib.ref ->
  scope:Scoped.scope ->
  flex:Term.t ->
  Term.t ->
  Subst.FO.t CCList.t

module Make (S : sig ... end) : sig ... end