Index of modules


A
AC [LogtkFOTerm]
Arith [LogtkSignature.TPTP]
Arith [LogtkFOTerm.TPTP]
Arith [LogtkSymbol.TPTP]
ArithOp [LogtkSymbol]

B
Base [LogtkFormula.S]
Base [LogtkSymbol]
BasicEquation [LogtkIndex]
Build [LogtkPosition]

C
C [LogtkIndex.SUBSUMPTION_IDX]
Cache [Logtk]
Classic [LogtkFOTerm]
Classic view
Closure [LogtkTypeInference]
Cnf [Logtk]
Comparison [Logtk]
Congruence [Logtk]
Constr [LogtkPrecedence_intf.S]
Conv [LogtkType]
Ctx [LogtkTypeInference]

D
DB [LogtkScopedTerm]
DBEnv [Logtk]
Default [LogtkDtree]
Default [LogtkOrdering]
Default [LogtkPrecedence]
Dot [LogtkLazyGraph]
Pretty printing in the DOT (graphviz) format
Dtree [Logtk]
Dummy [LogtkCache]
Dummy2 [LogtkCache]

E
E [LogtkRewriting.ORDERED]
E [LogtkIndex.UNIT_IDX]
Module that describes indexed equations

F
FO [LogtkCongruence]
FO [LogtkTypeInference]
FO [LogtkUnif]
FO [LogtkSubsts]
FO [LogtkFormula]
FOTerm [Logtk]
FastFingerprint [Logtk]
Feature [LogtkFeatureVector.Make]
FeatureVector [Logtk]
Fingerprint [Logtk]
Flag [LogtkUtil]
Form [LogtkTransform.DAG]
Form [LogtkUnif]
Form [LogtkSubsts]
FormDag [LogtkTransform]
Trivial instance, with bare formulas
FormRW [LogtkRewriting]
Formula [Logtk]
FormulaShape [Logtk]
Full [LogtkLazyGraph]
Full interface to traversals

H
H [LogtkHashcons.S]
HO [LogtkCongruence]
HO [LogtkTypeInference]
HO [LogtkUnif]
HO [LogtkSubsts]
HORewriting [Logtk]
HOTerm [Logtk]
Hashcons [Logtk]
Heap [LogtkLazyGraph]

I
IArray [Logtk]
Index [Logtk]
Infix [LogtkLazyGraph]
Infix [LogtkUtil]
Interfaces [Logtk]

K
Kind [LogtkScopedTerm]

L
LRU [LogtkCache]
Lambda [Logtk]
LazyGraph [Logtk]
LazyList [Logtk]
Leaf [LogtkIndex.TERM_IDX]
Linear [LogtkCache]
Linear2 [LogtkCache]
Logtk
Contains every other module
LogtkCache
Memoization caches
LogtkCache [LogtkHOTerm]
LogtkCnf
Reduction to CNF and simplifications
LogtkComparison
Partial LogtkOrdering values
LogtkCongruence
Simple and Lightweight Congruence and order
LogtkDBEnv
De Bruijn environments
LogtkDtree
Perfect Discrimination Tree
LogtkFOTerm
First-order terms Terms use LogtkScopedTerm with kind "LogtkFOTerm".
LogtkFastFingerprint
Experimental Fingerprint LogtkIndexing
LogtkFeatureVector
Feature Vector indexing
LogtkFingerprint
Fingerprint term indexing
LogtkFormula
First-order LogtkFormulas LogtkHashconsed formulas for first-order logic.
LogtkFormulaShape
Detect some specific formulas
LogtkHORewriting
LogtkRewriting on HO terms
LogtkHOTerm
Higher Order Terms
LogtkHashcons
LogtkHashconsing
LogtkIArray
Immutable Arrays
LogtkIndex
Generic term indexing
LogtkInterfaces
LogtkInterfaces
LogtkLambda
Lambda-Calculus
LogtkLazyGraph
Lazy graph polymorphic data structure
LogtkLazyList
Lazy List
LogtkMultiset
Generic multisets
LogtkNPDtree
Non-Perfect Discrimination Tree
LogtkOptions
Global CLI options
LogtkOrdering
Term LogtkOrderings
LogtkOrdering_intf
Partial ordering on terms
LogtkParseLocation
Location in a file
LogtkPartialOrder
Partial LogtkOrdering
LogtkPartialOrder_intf
Elements that can be compared
LogtkPosition
LogtkPositions in terms, clauses...
LogtkPrecedence
LogtkPrecedence (total ordering) on symbols
LogtkPrecedence_intf
Interface of LogtkPrecedence
LogtkPrologTerm
Prolog-like Terms.
LogtkRewriting
LogtkFOTerm rewriting
LogtkScopedTerm
Scoped Terms
LogtkSignature
LogtkSignature
LogtkSkolem
Skolem symbols
LogtkSourced
Sourced Statements
LogtkSubsts
Substitutions
LogtkSymbol
LogtkSymbols
LogtkTransform
LogtkTransformations on LogtkFormulas and Terms
LogtkType
LogtkTypes
LogtkTypeInference
LogtkType Inference
LogtkTypedPrologTerm
Prolog-like LogtkTyped Terms.
LogtkUnif
LogtkUnification and Matching
LogtkUtil
Some helpers

M
Make [LogtkPartialOrder]
Make [LogtkMultiset]
Make [LogtkHashcons]
Make [LogtkFeatureVector]
Make [LogtkFastFingerprint]
Make [LogtkCongruence]
Make [LogtkNPDtree]
Make [LogtkFingerprint]
Make [LogtkDtree]
Make [LogtkOrdering]
Make [LogtkPrecedence]
Make [LogtkFormula]
MakeDAG [LogtkTransform]
Build a DAG
MakeLeaf [LogtkIndex]
MakeOrdered [LogtkRewriting]
MakeTRS [LogtkRewriting]
MakeTerm [LogtkNPDtree]
Map [LogtkTypedPrologTerm]
Map [LogtkFormula]
Functor to translate terms
Map [LogtkFormula.S]
Map [LogtkHOTerm]
Map [LogtkPrologTerm]
Map [LogtkType]
Map [LogtkFOTerm]
Map [LogtkScopedTerm]
Map [LogtkSymbol]
Multiset [Logtk]
Mutable [LogtkLazyGraph]

N
NPDtree [Logtk]
Nary [LogtkUnif]

O
Options [Logtk]
Ordering [Logtk]
Ordering_intf [Logtk]

P
ParseLocation [Logtk]
PartialOrder [Logtk]
PartialOrder_intf [Logtk]
Pos [LogtkHOTerm]
Pos [LogtkFOTerm]
Pos [LogtkScopedTerm]
Position [Logtk]
Prec [LogtkOrdering_intf.S]
Precedence [Logtk]
Precedence_intf [Logtk]
PrologTerm [Logtk]

R
Renaming [LogtkSubsts]
Replacing [LogtkCache]
Replacing2 [LogtkCache]
Rewriting [Logtk]

S
SMap [LogtkSignature]
ScopedTerm [Logtk]
Section [LogtkUtil]
Debug section
Seq [LogtkIArray]
Seq [LogtkMultiset.S]
Seq [LogtkTypedPrologTerm]
Seq [LogtkHORewriting]
Seq [LogtkPrecedence_intf.S]
Seq [LogtkSignature]
Seq [LogtkFormula.TERM]
Seq [LogtkFormula.S]
Seq [LogtkHOTerm]
Seq [LogtkPrologTerm]
Seq [LogtkType]
Seq [LogtkFOTerm]
Seq [LogtkScopedTerm]
Seq [LogtkSymbol]
Set [LogtkTypedPrologTerm]
Set [LogtkFormula.TERM]
Set [LogtkFormula.S]
Set [LogtkHOTerm]
Set [LogtkPrologTerm]
Set [LogtkType]
Set [LogtkFOTerm]
Set [LogtkScopedTerm]
Set [LogtkSymbol]
Signature [Logtk]
Skolem [Logtk]
Sourced [Logtk]
Subst [LogtkTypedPrologTerm]
Substs [Logtk]
Symbol [Logtk]

T
T2LogtkCache [LogtkFOTerm]
TLogtkCache [LogtkFOTerm]
TPTP [LogtkSignature]
TPTP [LogtkFormula.TERM]
TPTP [LogtkFormula.S]
TPTP [LogtkHOTerm]
TPTP [LogtkPrologTerm]
TPTP constructors and printing
TPTP [LogtkType]
TPTP [LogtkFOTerm]
TPTP [LogtkSymbol]
TRS [LogtkRewriting]
Tbl [LogtkTypedPrologTerm]
Tbl [LogtkFormula.S]
Tbl [LogtkHOTerm]
Tbl [LogtkPrologTerm]
Tbl [LogtkType]
Tbl [LogtkFOTerm]
Tbl [LogtkScopedTerm]
Tbl [LogtkSymbol]
Transform [Logtk]
Ty [LogtkUnif]
Ty [LogtkSubsts]
Type [Logtk]
TypeInference [Logtk]
TypedPrologTerm [Logtk]

U
Unary [LogtkUnif]
To be used only on terms without LogtkScopedTerm.Multiset constructor
Unif [Logtk]
Util [Logtk]

V
Visitor [LogtkTypedPrologTerm]