package acgtk

You can search for identifiers within the package.

in-package search v0.2.0

acgtkLib.acgData
- AcgData
  - Acg_lexicon
    
    Data_Lexicon
    
    Signature
  - Environment
    
    Environment
    
    Lexicon
    
    Signature
    
    Signature1
    
    Environment_sig
    
    Lexicon
    
    Signature
    
    Signature1
  - Error
  - Interface
    
    Lexicon_sig
    
    Signature
    
    Signature_sig
  - Reduction
    
    Make
    
    Sg
  - Signature
    
    Data_Signature
  - Type_system
    
    SIG_ACCESS
    
    Type_System
    
    Make
    
    Signature
acgtkLib.datalogLib
- DatalogLib
  - ArrayTraversal
    
    Evaluator_TYPE
    
    Evaluator_TYPE2
    
    Make
    
    E
    
    Make2
    
    E
  - Datalog
    
    ASPred
    
    PredIdTable
    
    ASProg
    
    ASRule
    
    Datalog
    
    Predicate
    
    Premise
    
    Program
    
    Rule
    
    FactArray
    
    UF
    
    Datalog_Sig
    
    Predicate
    
    Premise
    
    Program
    
    Rule
    
    FactArray
    
    UF
    
    Make
    
    Predicate
    
    Premise
    
    Program
    
    Rule
    
    FactArray
    
    S
    
    UF
  - Datalog_AbstractSyntax
    
    AbstractSyntax
    
    Predicate
    
    PredIdTable
    
    Program
    
    Proto_Program
    
    Proto_Rule
    
    Rule
    
    ConstGen
    
    Table
    
    VarGen
    
    Table
  - Db_lexer
  - Db_parser
  - PersistentArray
    
    PersistentArray
  - UnionFind
    
    Make
    
    St
    
    S
    
    Store
    
    StoreAsMap
acgtkLib.logic
- Logic
  - Abstract_syntax
    
    Abstract_syntax
  - Lambda
    
    Lambda
  - TypeInference
    
    Type
  - VarUnionFind
    
    UF
    
    Value
acgtkLib.utilsLib
- UtilsLib
  - DependencyManager
    
    Make
    
    Manager_sig
  - Focused_list
    
    Focused_list
  - IdGenerator
    
    CorrespondanceTableTYPE
    
    IdGen
    
    ID
    
    Table
    
    IdGen_TYPE
    
    Table
    
    IdType
    
    IntIdGen
    
    Table
  - Log
  - SharedForest
    
    SharedForest
  - Table
    
    BASE
    
    Make_table
    
    Base
    
    TABLE
  - Tries
    
    Tries
  - Utils
  - Version
  - Warnings

Legend:
Library
Module
Module type
Parameter
Class
Class type

Modules with this module type should provide Union-Find algorithms and the indexed storage data structure. Note that we take the opportunity of implementing from scratch such algorithms to allow the find function returns not only the index of the representative and the values it indexes, but also the storage data structure, so that the find algorithm can modify it, in particular with path compression.

Modules with this module type should provide an indexed (by int indexes) storage data structure for 'a type values and access and update functions.

module UF (Value : sig ... end) : sig ... end

This module implements a UnionFind data structure. The S parameter is used to try different implementations of indexed data structure, in particular eventually persistent arrays as described in "A Persistent Union-Find Data Structure" (Sylvain Conchon and Jean-Chrisophe Filliâtre