aggregate.pl -- Aggregation operators on backtrackable predicates![]() | ||
|---|---|---|
apply.pl -- Apply predicates on a list![]() | ||
apply_macros.pl -- Goal expansion rules to avoid meta-calling![]() | ||
arithmetic.pl -- Extensible arithmetic![]() | ||
assoc.pl -- Binary associations![]() | ||
atom.pl -- Operations on atoms![]() | ||
backcomp.pl -- Backward compatibility![]() | ||
base32.pl -- Base32 encoding and decoding![]() | ||
base64.pl -- Base64 encoding and decoding![]() | ||
broadcast.pl -- Event service![]() | ||
charsio.pl -- I/O on Lists of Character Codes![]() | ||
codesio.pl -- I/O on Lists of Character Codes![]() | ||
coinduction.pl -- Co-Logic Programming![]() | ||
csv.pl -- Process CSV (Comma-Separated Values) data![]() | ||
ctypes.pl -- Character code classification![]() | ||
date.pl -- Process dates and times![]() | ||
debug.pl -- Print debug messages and test assertions![]() | ||
dialect.pl -- Support multiple Prolog dialects![]() | ||
dicts.pl -- Dict utilities![]() | ||
dif.pl -- The dif/2 constraint![]() | ||
edinburgh.pl -- Some traditional Edinburgh predicates![]() | ||
error.pl![]() | ||
gensym.pl -- Generate unique symbols![]() | ||
git.pl -- Run GIT commands![]() | ||
heaps.pl -- heaps/priority queues![]() | ||
iostream.pl -- Utilities to deal with streams![]() | ||
lazy_lists.pl -- Lazy list handling![]() | ||
lists.pl -- List Manipulation![]() | ||
macros.pl -- Macro expansion![]() | ||
main.pl -- Provide entry point for scripts![]() | ||
modules.pl -- Module utility predicates![]() | ||
occurs.pl![]() | ||
| contains_term/2 | Succeeds if Sub is contained in Term (=, deterministically). | ![]() |
| contains_var/2 | Succeeds if Sub is contained in Term (==, deterministically). | ![]() |
| free_of_term/2 | Succeeds of Sub does not unify to any subterm of Term. | ![]() |
| free_of_var/2 | Succeeds of Sub is not equal (==) to any subterm of Term. | ![]() |
| occurrences_of_term/3 | Count the number of SubTerms in Term that unify with SubTerm. | ![]() |
| occurrences_of_var/3 | Count the number of SubTerms in Term that are equal to SubTerm. | ![]() |
| sub_term/2 | Generates (on backtracking) all subterms of Term. | ![]() |
| sub_term_shared_variables/3 | If Sub is a sub term of Term, Vars is bound to the list of variables in Sub that also appear outside Sub in Term. | ![]() |
| sub_var/2 | Generates (on backtracking) all subterms (==) of Term. | ![]() |
operators.pl -- Manage operators![]() | ||
option.pl -- Option list processing![]() | ||
ordsets.pl -- Ordered set manipulation![]() | ||
pairs.pl -- Operations on key-value lists![]() | ||
persistency.pl -- Provide persistent dynamic predicates![]() | ||
pio.pl -- Pure I/O![]() | ||
pprint.pl -- Pretty Print Prolog terms![]() | ||
predicate_options.pl -- Access and analyse predicate options![]() | ||
prolog_breakpoints.pl -- Manage Prolog break-points![]() | ||
prolog_clause.pl![]() | ||
prolog_code.pl -- Utilities for reasoning about code![]() | ||
prolog_colour.pl -- Prolog syntax colouring support.![]() | ||
prolog_format.pl -- Analyse format specifications![]() | ||
prolog_pack.pl -- A package manager for Prolog![]() | ||
prolog_profile.pl -- Execution profiler![]() | ||
prolog_source.pl -- Examine Prolog source-files![]() | ||
prolog_stack.pl -- Examine the Prolog stack![]() | ||
prolog_xref.pl -- Prolog cross-referencer data collection![]() | ||
pure_input.pl -- Pure Input from files and streams![]() | ||
quasi_quotations.pl -- Define Quasi Quotation syntax![]() | ||
random.pl -- Random numbers![]() | ||
rbtrees.pl -- Red black trees![]() | ||
readutil.pl -- Read utilities![]() | ||
record.pl -- Access compound arguments by name![]() | ||
sandbox.pl![]() | ||
| sandbox_allowed_directive/1 | Throws an exception if G is not considered a safe directive. | ![]() |
| sandbox_allowed_expansion/1 | Throws an exception if G is not considered a safe expansion goal. | ![]() |
| sandbox_allowed_goal/1 | Throw an exception if it is not safe to call G. | ![]() |
| format_calls/3 | Find ~@ calls from Format and Args. | ![]() |
| safe_call/1 | Call Goal if it complies with the sandboxing rules. | ![]() |
| safe_directive/1 | Hook to declare additional directives as safe. | ![]() |
| safe_global_variable/1 | Declare the given global variable safe to write to. | ![]() |
| safe_goal/1 | True if calling Goal provides no security risc. | ![]() |
| safe_meta/2 | Hook. | ![]() |
| safe_primitive/1 | True if Goal is safe to call (i.e., cannot access dangerous system-resources and cannot upset other parts of the Prolog process). | ![]() |
| safe_prolog_flag/2 | True if it is safe to set the flag Flag to Value. | ![]() |
settings.pl -- Setting management![]() | ||
shlib.pl -- Utility library for loading foreign objects (DLLs, shared objects)![]() | ||
solution_sequences.pl -- Modify solution sequences![]() | ||
sort.pl![]() | ||
statistics.pl -- Get information about resource usage![]() | ||
streams.pl -- Manage Prolog streams![]() | ||
system.pl -- System utilities![]() | ||
tables.pl -- XSB interface to tables![]() | ||
terms.pl -- Term manipulation![]() | ||
thread_pool.pl -- Resource bounded thread management![]() | ||
ugraphs.pl![]() | ||
| add_edges/3 | Unify NewGraph with a new graph obtained by adding the list of Edges to Graph. | ![]() |
| add_vertices/3 | Unify NewGraph with a new graph obtained by adding the list of Vertices to Graph. | ![]() |
| complement/2 | UGraphOut is a ugraph with an edge between all vertices that are not connected in UGraphIn and all edges from UGraphIn removed. | ![]() |
| compose/3 | Compose NewGraph by connecting the drains of LeftGraph to the sources of RightGraph. | ![]() |
| connect_ugraph/3 | Adds Start as an additional vertex that is connected to all vertices in UGraphIn. | ![]() |
| del_edges/3 | Unify NewGraph with a new graph obtained by removing the list of Edges from Graph. | ![]() |
| del_vertices/3 | Unify NewGraph with a new graph obtained by deleting the list of Vertices and all the edges that start from or go to a vertex in Vertices to the Graph. | ![]() |
| edges/2 | Unify Edges with all edges appearing in Graph. | ![]() |
| neighbors/3 | Neigbours is a sorted list of the neighbours of Vertex in Graph. | ![]() |
| neighbours/3 | Neigbours is a sorted list of the neighbours of Vertex in Graph. | ![]() |
| reachable/3 | True when Vertices is an ordered set of vertices reachable in UGraph, including Vertex. | ![]() |
| top_sort/2 | Sort vertices topologically. | ![]() |
| transitive_closure/2 | Generate the graph Closure as the transitive closure of Graph. | ![]() |
| transpose_ugraph/2 | Unify NewGraph with a new graph obtained from Graph by replacing all edges of the form V1-V2 by edges of the form V2-V1. | ![]() |
| ugraph_layers/2 | Sort vertices topologically. | ![]() |
| ugraph_union/3 | NewGraph is the union of Graph1 and Graph2. | ![]() |
| vertices/2 | Unify Vertices with all vertices appearing in Graph. | ![]() |
| vertices_edges_to_ugraph/3 | Create a UGraph from Vertices and Edges. | ![]() |
url.pl -- Analysing and constructing URL![]() | ||
utf8.pl -- UTF-8 encoding/decoding on lists of character codes.![]() | ||
varnumbers.pl -- Utilities for numbered terms![]() | ||
wfs.pl -- Well Founded Semantics interface![]() | ||
when.pl -- Conditional coroutining![]() | ||
www_browser.pl -- Open a URL in the users browser![]() | ||
yall.pl -- Lambda expressions![]() | ||