Index of modules

Objects through which predicate extents are accessed.

Implementation of TableType using association lists.

Implementation of some Built-Ins.

Configuration.

Convenience functions for accessing terms with OCaml.

Discrimination tree indexing.

Entry point to "global" settings and datastructures.

Errors.

Arithmetic evaluation.

Representation of derived facts and associated meta information.

Redirecting stdin and stdout.

Graph operations.

Implementation of TableType using hash tables.

Compiled input clauses.

Creating and analyzing sets of compiled input clauses.

Index interface.

Printing human readable information.

Indexes with undoable modifications.

Utility functions for list manipulation.

If this module is present, Process.main () will be invoked.

Functor for building a layered index implementation based on an implementation of Index.Index.

Functor for building an index implementation.

Functor building an implementation of the Ordset.AuxS type given a totally ordered type.

Messages to the user.

Store for negative unit literals.

Storing and processing of newly derived facts (similar to a SOS).

An index implementation that does not do any indexing.

Data structures used for optimization.

Representation of sets as ordered list.

Information associated with predicates.

The KRH processor main loop.

A lexical analyzer for ISO-Prolog syntax.

Printing terms in ISO-Prolog syntax.

ISO-Prolog parser.

Returns a string identifying the release of KRHyper distribution.

Sharing of input terms.

Comparison of terms according to the ISO-Prolog standard total ordering of terms.

Evaluation of clause sets.

Term representation and operations on terms.

A predefined discrimination tree implementation that uses terms as entries and association lists for the internal tree representation.

A predefined discrimination tree implementation that uses terms as entries and hashtables for the internal tree representation.

Utility functions for terms.

Weighing Terms.