library

Prolog files

aggregate.pl  -- Aggregation operators on backtrackable predicates
ansi_term.pl  -- Print decorated text to ANSI consoles
apply.pl
convlist/3	Similar to maplist/3, but elements for which call(Goal, ElemIn, _) fails are omitted from ListOut.
exclude/3	Filter elements for which Goal fails.
foldl/4	Fold an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("fold-left"), using columns of m list elements as arguments for Goal.
foldl/5	Fold an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("fold-left"), using columns of m list elements as arguments for Goal.
foldl/6	Fold an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("fold-left"), using columns of m list elements as arguments for Goal.
foldl/7	Fold an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("fold-left"), using columns of m list elements as arguments for Goal.
include/3	Filter elements for which Goal succeeds.
maplist/2	True if Goal is successfully applied on all matching elements of the list.
maplist/3	True if Goal is successfully applied on all matching elements of the list.
maplist/4	True if Goal is successfully applied on all matching elements of the list.
maplist/5	True if Goal is successfully applied on all matching elements of the list.
partition/4	Filter elements of List according to Pred.
partition/5	Filter List according to Pred in three sets.
scanl/4	Scan an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("scan-left"), using columns of m list elements as arguments for Goal.
scanl/5	Scan an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("scan-left"), using columns of m list elements as arguments for Goal.
scanl/6	Scan an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("scan-left"), using columns of m list elements as arguments for Goal.
scanl/7	Scan an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("scan-left"), using columns of m list elements as arguments for Goal.
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
check.pl
check/0	Run all consistency checks defined by checker/2.
checker/2	Register code validation routines.
list_autoload/0	Report predicates that may be auto-loaded.
list_cross_module_calls/0	List calls from one module to another using Module:Goal where the callee is not defined exported, public or multifile, i.e., where the callee should be considered private.
list_format_errors/0	List argument errors for format/2,3.
list_format_errors/1	List argument errors for format/2,3.
list_rationals/0	List rational numbers that appear in clauses.
list_rationals/1	List rational numbers that appear in clauses.
list_redefined/0	Lists predicates that are defined in the global module user as well as in a normal module; that is, predicates for which the local definition overrules the global default definition.
list_strings/0	List strings that appear in clauses.
list_strings/1	List strings that appear in clauses.
list_trivial_fails/0	List goals that trivially fail because there is no matching clause.
list_trivial_fails/1	List goals that trivially fail because there is no matching clause.
list_undefined/0	Report undefined predicates.
list_undefined/1	Report undefined predicates.
list_void_declarations/0	List predicates that have declared attributes, but no clauses.
string_predicate/1	Multifile hook to disable list_strings/0 on the given predicate.
trivial_fail_goal/1	Multifile hook that tells list_trivial_fails/0 to accept Goal as valid.
valid_string_goal/1	Multifile hook that qualifies Goal as valid for list_strings/0.
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
edit.pl  -- Editor interface
error.pl
exceptions.pl  -- Exception classification
explain.pl  -- Describe Prolog Terms
fastrw.pl
fast_read/1	The next term is read from current standard input and is unified with Term.
fast_write/1	Output Term in a way that fast_read/1 and fast_read/2 will be able to read it back.
fast_write_to_string/3	Perform a fast-write to the difference-slist String\Tail.
files.pl
can_open_file/2	Succeeds if the user has access to `File' in mode `Mode'.
chdir/1	Change Working Directory.
gensym.pl  -- Generate unique symbols
git.pl  -- Run GIT commands
hashtable.pl  -- Hash tables
heaps.pl  -- heaps/priority queues
help.pl
apropos/1	Print objects from the manual whose name or summary match with Query.
help/0	Show help for What.
help/1	Show help for What.
help_text/2	When Predicate is a term of the form Name/Arity for which documentation exists, HelpText is the documentation in textual format (parsed from the HTML help).
show_html_hook/1	Hook called to display the extracted HTML document.
increval.pl  -- Incremental dynamic predicate modification
intercept.pl  -- Intercept and signal interface
iostream.pl  -- Utilities to deal with streams
lazy_lists.pl  -- Lazy list handling
listing.pl  -- List programs and pretty print clauses
lists.pl  -- List Manipulation
main.pl  -- Provide entry point for scripts
make.pl  -- Reload modified source files
modules.pl  -- Module utility predicates
nb_set.pl  -- Non-backtrackable sets
occurs.pl  -- Finding and counting sub-terms
operators.pl  -- Manage operators
option.pl  -- Option list processing
optparse.pl
opt_arguments/3	Extract commandline options according to a specification.
opt_help/2	True when Help is a help string synthesized from OptsSpec.
opt_parse/4	Equivalent to opt_parse(OptsSpec, ApplArgs, Opts, PositionalArgs, []).
opt_parse/5	Parse the arguments Args (as list of atoms) according to OptsSpec.
parse_type/3	Hook to parse option text Codes to an object of type Type.
ordsets.pl  -- Ordered set manipulation
pairs.pl  -- Operations on key-value lists
persistency.pl
current_persistent_predicate/1	True if PI is a predicate that provides access to the persistent database DB.
db_assert/1	Assert Term into the database and record it for persistency.
db_attach/2	Use File as persistent database for the calling module.
db_attached/1	True if the context module attached to the persistent database File.
db_detach/0	Detach persistency from the calling module and delete all persistent clauses from the Prolog database.
db_retract/1	Retract terms from the database one-by-one.
db_retractall/1	Retract all matching facts and do the same in the database.
db_sync/1	Synchronise database with the associated file.
db_sync_all/1	Sync all registered databases.
persistent/1	Declare dynamic database terms.
pio.pl  -- Pure I/O
portray_text.pl
portray_text/1	Switch portraying on or off.
set_portray_text/2	Set options for portraying.
set_portray_text/3	Set options for portraying.
pprint.pl  -- Pretty Print Prolog terms
predicate_options.pl  -- Access and analyse predicate options
prolog_autoload.pl  -- Autoload all dependencies
prolog_breakpoints.pl  -- Manage Prolog break-points
prolog_clause.pl
prolog_code.pl  -- Utilities for reasoning about code
prolog_codewalk.pl  -- Prolog code walker
prolog_colour.pl  -- Prolog syntax colouring support.
prolog_config.pl  -- Provide configuration information
prolog_coverage.pl  -- Coverage analysis tool
prolog_debug.pl  -- User level debugging tools
prolog_format.pl  -- Analyse format specifications
prolog_history.pl  -- Per-directory persistent commandline history
prolog_jiti.pl  -- Just In Time Indexing (JITI) utilities
prolog_metainference.pl  -- Infer meta-predicate properties
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_trace.pl  -- Print access to predicates
prolog_versions.pl  -- Demand specific (Prolog) versions
prolog_wrap.pl
current_predicate_wrapper/4	True if Head is wrapped with Body.
unwrap_predicate/2	Remove the outermost wrapper whose name unifies with Name.
wrap_predicate/4	Wrap the predicate referenced by Head using Body.
prolog_xref.pl
called_by/2	If this succeeds, the cross-referencer assumes Goal may call any of the goals in ListOfCalled.
called_by/4	True when Called is a list of callable terms called from Goal, handled by the predicate Module:Goal and executed in the context of the module Context.
hook/1	True if Goal is a hook that is called spontaneously (e.g., from foreign code).
meta_goal/2	Define meta-predicates.
xref_called/3	True when By is called from Called in Source.
xref_called/4	True when By is called from Called in Source.
xref_called/5	True when By is called from Called in Source.
xref_clean/1	Reset the database for the given source.
xref_comment/3	Is true when Source has a section comment with Title and Comment.
xref_comment/4	Is true when Head in Source has the given PlDoc comment.
xref_current_source/1	Check what sources have been analysed.
xref_defined/3	Test if Goal is accessible in Source.
xref_definition_line/2	If the 3th argument of xref_defined contains line info, return this in Line.
xref_done/2	Cross-reference executed at Time.
xref_exported/2	True when Source exports Head.
xref_hook/1	Definition of known hooks.
xref_meta/2	True when Called is a list of terms called from Head.
xref_meta/3	True when Head calls Called in Source.
xref_mode/3	Is true when Source provides a predicate with Mode and determinism.
xref_module/2	True if Module is defined in Source.
xref_op/2	Give the operators active inside the module.
xref_option/2	True when Source was processed using Option.
xref_prolog_flag/4	True when Flag is set to Value at Line in Source.
xref_public_list/3	Find meta-information about File.
xref_public_list/4	Find meta-information about File.
xref_public_list/6	Find meta-information about File.
xref_public_list/7	Find meta-information about File.
xref_source/1	Generate the cross-reference data for Source if not already done and the source is not modified.
xref_source/2	Generate the cross-reference data for Source if not already done and the source is not modified.
xref_source_file/3	Find named source file from Spec, relative to Src.
xref_source_file/4	Find named source file from Spec, relative to Src.
xref_uses_file/3	True when Source tries to load a file using Spec.
pure_input.pl  -- Pure Input from files and streams
quasi_quotations.pl  -- Define Quasi Quotation syntax
quintus.pl  -- Quintus compatibility
random.pl  -- Random numbers
rbtrees.pl
is_rbtree/1	True if Term is a valid Red-Black tree.
list_to_rbtree/2	Tree is the red-black tree corresponding to the mapping in List, which should be a list of Key-Value pairs.
ord_list_to_rbtree/2	Tree is the red-black tree corresponding to the mapping in list List, which should be a list of Key-Value pairs.
rb_apply/4	If the value associated with key Key is Val0 in Tree, and if call(G,Val0,ValF) holds, then NewTree differs from Tree only in that Key is associated with value ValF in tree NewTree.
rb_clone/3	`Clone' the red-back tree TreeIn into a new tree TreeOut with the same keys as the original but with all values set to unbound values.
rb_del_max/4	Delete the largest element from the tree Tree, returning the key Key, the value Val associated with the key and a new tree NewTree.
rb_del_min/4	Delete the least element from the tree Tree, returning the key Key, the value Val associated with the key and a new tree NewTree.
rb_delete/3	Delete element with key Key from the tree Tree, returning the value Val associated with the key and a new tree NewTree.
rb_delete/4	Same as rb_delete(Tree, Key, NewTree), but also unifies Val with the value associated with Key in Tree.
rb_empty/1	Succeeds if Tree is an empty Red-Black tree.
rb_fold/4	Fold the given predicate over all the key-value pairs in Tree, starting with initial state State0 and returning the final state State.
rb_in/3	True when Key-Value is a key-value pair in red-black tree Tree.
rb_insert/4	Add an element with key Key and Value to the tree Tree creating a new red-black tree NewTree.
rb_insert_new/4	Add a new element with key Key and Value to the tree Tree creating a new red-black tree NewTree.
rb_keys/2	Keys is unified with an ordered list of all keys in the Red-Black tree Tree.
rb_lookup/3	True when Value is associated with Key in the Red-Black tree Tree.
rb_map/2	True if call(Goal, Value) is true for all nodes in T.
rb_map/3	For all nodes Key in the tree Tree, if the value associated with key Key is Val0 in tree Tree, and if call(G,Val0,ValF) holds, then the value associated with Key in NewTree is ValF.
rb_max/3	Key is the maximal key in Tree, and is associated with Val.
rb_min/3	Key is the minimum key in Tree, and is associated with Val.
rb_new/1	Create a new Red-Black tree Tree.
rb_next/4	Next is the next element after Key in Tree, and is associated with Val.
rb_partial_map/4	For all nodes Key in Keys, if the value associated with key Key is Val0 in tree Tree, and if call(G,Val0,ValF) holds, then the value associated with Key in NewTree is ValF, otherwise it is the value associated with the key in Tree.
rb_previous/4	Previous is the previous element after Key in Tree, and is associated with Val.
rb_size/2	Size is the number of elements in Tree.
rb_update/4	Tree NewTree is tree Tree, but with value for Key associated with NewVal.
rb_update/5	Same as rb_update(Tree, Key, NewVal, NewTree) but also unifies OldVal with the value associated with Key in Tree.
rb_visit/2	Pairs is an infix visit of tree Tree, where each element of Pairs is of the form Key-Value.
readutil.pl  -- Read utilities
record.pl  -- Access compound arguments by name
sandbox.pl
settings.pl  -- Setting management
shell.pl  -- Elementary shell commands
shlib.pl  -- Utility library for loading foreign objects (DLLs, shared objects)
solution_sequences.pl  -- Modify solution sequences
sort.pl
locale_sort/2	Sort a list of atoms using the current locale.
predsort/3	Sorts similar to sort/2, but determines the order of two terms by calling Compare(-Delta, +E1, +E2).
statistics.pl  -- Get information about resource usage
strings.pl  -- String utilities
system.pl  -- System utilities
tables.pl  -- XSB interface to tables
terms.pl
foldsubterms/4	The predicate foldsubterms/5 calls call(Goal4, SubTerm1, SubTerm2, StateIn, StateOut) for each subterm, including variables, in Term1.
foldsubterms/5	The predicate foldsubterms/5 calls call(Goal4, SubTerm1, SubTerm2, StateIn, StateOut) for each subterm, including variables, in Term1.
mapargs/3	Term1 and Term2 have the same functor (name/arity) and for each matching pair of arguments call(Goal, A1, A2) is true.
mapsubterms/3	Recursively map sub terms of Term1 into subterms of Term2 for every pair for which call(Goal, ST1, ST2) succeeds.
mapsubterms_var/3	Recursively map sub terms of Term1 into subterms of Term2 for every pair for which call(Goal, ST1, ST2) succeeds.
same_functor/2	True when Term1 and Term2 are terms that have the same functor (Name/Arity).
same_functor/3	True when Term1 and Term2 are terms that have the same functor (Name/Arity).
same_functor/4	True when Term1 and Term2 are terms that have the same functor (Name/Arity).
subsumes/2	True if Generic is unified to Specific without changing Specific.
subsumes_chk/2	True if Generic can be made equivalent to Specific without changing Specific.
term_factorized/3	Is true when Skeleton is Term where all subterms that appear multiple times are replaced by a variable and Substitution is a list of Var=Value that provides the subterm at the location Var.
term_size/2	True if Size is the size in cells occupied by Term on the global (term) stack.
term_subsumer/3	General is the most specific term that is a generalisation of Special1 and Special2.
variant/2	Same as SWI-Prolog Term1 =@= Term2.
thread.pl  -- High level thread primitives
call_in_thread/2	Run Goal as an interrupt in the context of Thread.
concurrent/3	Run Goals in parallel using N threads.
concurrent_and/2	Concurrent version of (Generator,Test).
concurrent_and/3	Concurrent version of (Generator,Test).
concurrent_forall/2	True when Action is true for all solutions of Generate.
concurrent_forall/3	True when Action is true for all solutions of Generate.
concurrent_maplist/2	Concurrent version of maplist/2.
concurrent_maplist/3	Concurrent version of maplist/2.
concurrent_maplist/4	Concurrent version of maplist/2.
first_solution/3	Try alternative solvers concurrently, returning the first answer.
thread_pool.pl  -- Resource bounded thread management
threadutil.pl  -- Interactive thread utilities
tty.pl  -- Terminal operations
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
writef.pl  -- Old-style formatted write
www_browser.pl  -- Open a URL in the users browser
yall.pl  -- Lambda expressions
zip.pl  -- Access resource ZIP archives