Libraries

This package provides the following libraries (via dune):

acgtkLib.acgData

Documentation:

• AcgData.Acg_lexicon
• AcgData.Environment This modules implements a functor that build an environment containing signatures and lexicons when provided with to actual implementations of a signature and a lexicon
• AcgData.Error This module gives some types and some utilities to mange, emit and display messages
• AcgData.Interface This module signature describes the interface for modules implementing signatures
• AcgData.Reduction
• AcgData.Signature
• AcgData.Type_system

Dependencies: acgtkLib.logic, acgtkLib.datalogLib

acgtkLib.datalogLib

Documentation:

• DatalogLib.ArrayTraversal This module implements a depth-first array traversal. It is depth-first in order to fit with backtracking when cells contain persistent array.
• DatalogLib.Datalog
• DatalogLib.Datalog_AbstractSyntax
• DatalogLib.Db_lexer
• DatalogLib.Db_parser
• DatalogLib.DlError
• DatalogLib.Dl_lexer
• DatalogLib.Dl_parse_functions
• DatalogLib.Dl_parser
• DatalogLib.Messages
• DatalogLib.PersistentArray This module implements a persistent array data structure as described in "A Persistent Union-Find Data Structure" (Sylvain Concohn and Jean-Chrisophe Filliâtre.
• DatalogLib.UnionFind 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.

Dependencies: str, ANSITerminal, menhirLib, acgtkLib.utilsLib

acgtkLib.logic

Documentation:

• Logic.Abstract_syntax This modules implements the abstract syntax and the build function for the signatures
• Logic.Lambda
• Logic.TypeInference
• Logic.VarUnionFind 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.

Dependencies: ANSITerminal, acgtkLib.utilsLib

acgtkLib.utilsLib

Documentation:

• UtilsLib.DependencyManager This modules implements a functor that build a simple minded dependency manager. The later is used to store dependencies and to retrieve the data dependeding on an element
• UtilsLib.ErrorMg
• UtilsLib.Focused_list
• UtilsLib.IdGenerator This module implements various useful modules to generate IDs and to keep track of there association with string as in a symbol table
• UtilsLib.Log
• UtilsLib.SharedForest
• UtilsLib.Table This module implements a functor returning an non-funtional lookup table when provided with a given size
• UtilsLib.Tries This modules implements the tries
• UtilsLib.Utils This module provides some useful modules or functions
• UtilsLib.Version
• UtilsLib.Warnings This module implements a warning management module

Dependencies: str, ANSITerminal, logs, logs.fmt, mtime.clock.os, yojson