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
$apropos_match/2	True if Needle is a sub atom of Haystack.
$arch/2
$argv/1
$declare_module/3	Used in triple20 particle library.
$home/1
$module/2
$set_prompt/1	Set the prompt for the toplevel.
$sig_atomic/1	Execute Goal without processing signals.
$strip_module/3	This used to be an internal predicate.
$version/1
C/3	Used to be generated by DCG.
at_initialization/1	Register goal only to be run if a saved state is restored.
call_cleanup/3	Call Cleanup with an indication of the reason unified to Catcher.
checklist/2
concat/3
concat_atom/2	Concatenate a list of atomic values to an atom.
concat_atom/3	Concatenate a list of atomic values to an atom, inserting Separator between each consecutive elements.
convert_time/2	Convert a time-stamp as obtained though get_time/1 into a textual representation using the C-library function ctime().
convert_time/8	Convert a time stamp, provided by get_time/1, time_file/2, etc.
current_module/2	True if Module is a module loaded from File.
current_mutex/3
current_thread/2
displayq/1	Write term ignoring operators and quote atoms.
displayq/2	Write term ignoring operators and quote atoms.
eval_license/0
export_list/2	Module exports the predicates of List.
feature/2	Control Prolog flags.
flush/0
free_variables/2	Return a list of unbound variables in Term.
hash/1	Demands PredInd to be indexed using a hash-table.
hash_term/2	If Term is ground, Hash is unified to an integer representing a hash for Term.
index/1	Prepare the predicate indicated by Head for multi-argument indexing.
lock_predicate/2
merge/3	Merge the ordered sets List1 and List2 into a new ordered list.
merge_set/3	Merge the ordered sets Set1 and Set2 into a new ordered set without duplicates.
message_queue_size/2	True if Queue holds Size terms.
proper_list/1	Old SWI-Prolog predicate to check for a list that really ends in a [].
read_clause/1
read_clause/2
read_history/6
read_pending_input/3
read_variables/2
read_variables/3
set_base_module/1	Set the default module from which we inherit.
set_feature/2	Control Prolog flags.
setup_and_call_cleanup/3	Call Cleanup once after Goal is finished.
setup_and_call_cleanup/4	Call Cleanup once after Goal is finished, with Catcher unified to the reason.
sformat/2
sformat/3
string_to_atom/2	Bi-directional conversion between string and atom.
string_to_list/2	Bi-directional conversion between a string and a list of character codes.
sublist/3	Succeeds if List2 unifies with a list holding those terms for which call(Goal, Elem) succeeds.
substring/4	Predecessor of sub_string using 1-based Offset.
sumlist/2	True when Sum is the list of all numbers in List.
thread_at_exit/1	Register Goal to be called when the calling thread exits.
trie_insert_new/3
unlock_predicate/2
write_length/3
write_ln/1
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  -- Consistency checking
check_installation.pl  -- Check installation issues and features
check_config_files/0	Examines the locations of config files.
check_installation/0	Check features of the installed system.
check_installation/1	As check_installation/0, but additionally returns a list of Component-Problem pairs.
test_installation/0	Run regression tests in the installed system.
test_installation/1	Run regression tests in the installed system.
update_config_files/0	Move config files from their old location to the new if the file or directory exists in the old location but not in the new.
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_fill/4	Implementation for the dicts_to_same_keys/3 OnEmpty closure that fills new cells with a copy of ValueIn.
dict_keys/2	True when Keys is an ordered set of the keys appearing in Dict.
dict_size/2	True when KeyCount is the number of keys in Dict.
dicts_join/3	Join dicts in Dicts that have the same value for Key, provided they do not have conflicting values on other keys.
dicts_join/4	Join two lists of dicts (Dicts1 and Dicts2) on Key.
dicts_same_keys/2	True if List is a list of dicts that all have the same keys and Keys is an ordered set of these keys.
dicts_same_tag/2	True when List is a list of dicts that all have the tag Tag.
dicts_slice/3	DictsOut is a list of Dicts only containing values for Keys.
dicts_to_compounds/4	True when Dicts and Compounds are lists of the same length and each element of Compounds is a compound term whose arguments represent the values associated with the corresponding keys in Keys.
dicts_to_same_keys/3	DictsOut is a copy of DictsIn, where each dict contains all keys appearing in all dicts of DictsIn.
mapdict/2	True when all dicts have the same set of keys and call(Goal, Key, V1, ...) is true for all keys in the dicts.
mapdict/3	True when all dicts have the same set of keys and call(Goal, Key, V1, ...) is true for all keys in the dicts.
mapdict/4	True when all dicts have the same set of keys and call(Goal, Key, V1, ...) is true for all keys in the dicts.
dif.pl  -- The dif/2 constraint
edinburgh.pl  -- Some traditional Edinburgh predicates
edit.pl
edit/0	Edit associated or script file.
edit/1	Edit indicated object.
edit_command/2	This predicate should specify the shell-command called to invoke the user's editor.
locate/2	Locate object from the specified location.
locate/3
predicate_location/2	Find the source location of a predicate.
select_location/3
error.pl
current_encoding/1	True if Name is the name of a supported encoding.
current_type/3	True when Type is a currently defined type and Var satisfies Type of the body term Body succeeds.
domain_error/2	The argument is of the proper type, but has a value that is outside the supported values.
existence_error/2	Culprit is of the correct type and correct domain, but there is no existing (external) resource of type ObjectType that is represented by it.
existence_error/3	Culprit is of the correct type and correct domain, but there is no existing (external) resource of type ObjectType that is represented by it in the provided set.
has_type/2	True if Term satisfies Type.
instantiation_error/1	An argument is under-instantiated.
is_of_type/2	True if Term satisfies Type.
must_be/2	True if Term satisfies the type constraints for Type.
permission_error/3	It is not allowed to perform Operation on (whatever is represented by) Culprit that is of the given PermissionType (in fact, the ISO Standard is confusing and vague about these terms' meaning).
representation_error/1	A representation error indicates a limitation of the implementation.
resource_error/1	A goal cannot be completed due to lack of resources.
syntax_error/1	A text has invalid syntax.
type_error/2	Tell the user that Culprit is not of the expected ValidType.
uninstantiation_error/1	An argument is over-instantiated.
exceptions.pl
catch/4	As catch/3, only catching exceptions for which exception(ErrorType,Ball) is true.
error_term/2	Describe the formal part of error(Formal,ImplDefined) exceptions.
exception/2	If Ball is unbound, adds a delayed goal that tests the error belongs to Type when Ball is instantiated (by catch/3).
exception_term/2	Describe exceptions that are not error(Formal, _) terms.
exception_type/2	Declare all exceptions subsumed by Term to be an exception of Type.
explain.pl
explain/1	Give an explanation on Term.
explain/2	True when Explanation is an explanation of Term.
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
add_to_heap/4	Adds Value with priority Key to Heap0, constructing a new heap in Heap.
delete_from_heap/4	Deletes Value from Heap0, leaving its priority in Key and the resulting data structure in Heap.
empty_heap/1	True if Heap is an empty heap.
get_from_heap/4	Retrieves the minimum-priority pair Key-Value from Heap0.
heap_size/2	Determines the number of elements in Heap.
heap_to_list/2	Constructs a list List of Key-Value terms, ordered by (ascending) priority.
is_heap/1	Returns true if X is a heap.
list_to_heap/2	If List is a list of Key-Value terms, constructs a heap out of List.
merge_heaps/3	Merge the two heaps Heap0 and Heap1 in Heap.
min_of_heap/3	Unifies Value with the minimum-priority element of Heap and Key with its priority value.
min_of_heap/5	Gets the two minimum-priority elements from Heap.
singleton_heap/3	True if Heap is a heap with the single element Key-Value.
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
close_any/1	Execute the Close closure returned by open_any/5.
open_any/5	Establish a stream from Specification that should be closed using Close, which can either be called or passed to close_any/1.
lazy_lists.pl  -- Lazy list handling
listing.pl  -- List programs and pretty print clauses
lists.pl
append/2	Concatenate a list of lists.
append/3	List1AndList2 is the concatenation of List1 and List2.
clumped/2	Pairs is a list of Item-Count pairs that represents the run length encoding of Items.
delete/3	Delete matching elements from a list.
flatten/2	Is true if FlatList is a non-nested version of NestedList.
intersection/3	True if Set3 unifies with the intersection of Set1 and Set2.
is_set/1	True if Set is a proper list without duplicates.
last/2	Succeeds when Last is the last element of List.
list_to_set/2	True when Set has the same elements as List in the same order.
max_list/2	True if Max is the largest number in List.
max_member/2	True when Max is the largest member in the standard order of terms.
max_member/3	True when Max is the largest member according to Pred, which must be a 2-argument callable that behaves like (@=<)/2.
member/2	True if Elem is a member of List.
min_list/2	True if Min is the smallest number in List.
min_member/2	True when Min is the smallest member in the standard order of terms.
min_member/3	True when Min is the smallest member according to Pred, which must be a 2-argument callable that behaves like (@=<)/2.
nextto/3	True if Y directly follows X in List.
nth0/3	True when Elem is the Index'th element of List.
nth1/3	Is true when Elem is the Index'th element of List.
nth1/4	As nth0/4, but counting starts at 1.
numlist/3	List is a list [Low, Low+1, ... High].
permutation/2	True when Xs is a permutation of Ys.
prefix/2	True iff Part is a leading substring of Whole.
proper_length/2	True when Length is the number of elements in the proper list List.
reverse/2	Is true when the elements of List2 are in reverse order compared to List1.
same_length/2	Is true when List1 and List2 are lists with the same number of elements.
select/3	Is true when List1, with Elem removed, results in List2.
select/4	Select from two lists at the same position.
selectchk/3	Semi-deterministic removal of first element in List that unifies with Elem.
selectchk/4	Semi-deterministic version of select/4.
subseq/3	Is true when SubList contains a subset of the elements of List in the same order and Complement contains all elements of List not in SubList, also in the order they appear in List.
subset/2	True if all elements of SubSet belong to Set as well.
subtract/3	Delete all elements in Delete from Set.
union/3	True if Set3 unifies with the union of the lists Set1 and Set2.
macros.pl  -- Macro expansion
main.pl  -- Provide entry point for scripts
make.pl  -- Reload modified source files
modules.pl  -- Module utility predicates
nb_rbtrees.pl
nb_rb_get_node/3	True if Node is the node in RBTree associated to Key.
nb_rb_insert/3	Add Key-Value to the tree RBTree using non-backtrackable destructive assignment.
nb_rb_node_value/2	Value is the value associated to Node.
nb_rb_set_node_value/2	Associate Value with Node.
nb_set.pl  -- Non-backtrackable sets
add_nb_set/2	Insert Key into the set.
add_nb_set/3	Insert Key into the set.
empty_nb_set/1	Create an empty non-backtrackable set.
gen_nb_set/2	Enumerate the members of a set in the standard order of terms.
nb_set_to_list/2	Get the elements of a an nb_set.
size_nb_set/2	Unify Size with the number of elements in the set.
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
is_ordset/1	True if Term is an ordered set.
list_to_ord_set/2	Transform a list into an ordered set.
ord_add_element/3	Insert an element into the set.
ord_del_element/3	Delete an element from an ordered set.
ord_disjoint/2	True if Set1 and Set2 have no common elements.
ord_empty/1	True when List is the empty ordered set.
ord_intersect/2	True if both ordered sets have a non-empty intersection.
ord_intersect/3	Intersection holds the common elements of Set1 and Set2.
ord_intersection/2	Intersection of a powerset.
ord_intersection/3	Intersection holds the common elements of Set1 and Set2.
ord_intersection/4	Intersection and difference between two ordered sets.
ord_memberchk/2	True if Element is a member of OrdSet, compared using ==.
ord_selectchk/3	Selectchk/3, specialised for ordered sets.
ord_seteq/2	True if Set1 and Set2 have the same elements.
ord_subset/2	Is true if all elements of Sub are in Super.
ord_subtract/3	Diff is the set holding all elements of InOSet that are not in NotInOSet.
ord_symdiff/3	Is true when Difference is the symmetric difference of Set1 and Set2.
ord_union/2	True if Union is the union of all elements in the superset SetOfSets.
ord_union/3	Union is the union of Set1 and Set2.
ord_union/4	True iff ord_union(Set1, Set2, Union) and ord_subtract(Set2, Set1, New).
oset.pl  -- Ordered set manipulation
pairs.pl  -- Operations on key-value lists
persistency.pl  -- Provide persistent dynamic predicates
portray_text.pl  -- Portray text
pprint.pl  -- Pretty Print Prolog terms
predicate_options.pl  -- Access and analyse predicate options
prolog_autoload.pl
autoload_all/0	Force all necessary autoloading to be done now.
autoload_all/1	Force all necessary autoloading to be done now.
prolog_breakpoints.pl  -- Manage Prolog break-points
prolog_clause.pl
clause_info/4	Fetches source information for the given clause.
clause_info/5	Fetches source information for the given clause.
clause_name/2	Provide a suitable description of the indicated clause.
initialization_layout/4	Find term-layout of :- initialization directives.
make_varnames/5	Create a Term varnames(...) where each argument contains the name of the variable at that offset.
open_source/2	Hook into clause_info/5 that opens the stream holding the source for a specific clause.
predicate_name/2	Describe a predicate as [Module:]Name/Arity.
unify_goal/5	This hook is called to fix up source code manipulations that result from goal expansions.
unify_term/2	Unify the two terms, where T2 is created by writing the term and reading it back in, but be aware that rounding problems may cause floating point numbers not to unify.
prolog_code.pl  -- Utilities for reasoning about code
prolog_codewalk.pl  -- Prolog code walker
prolog_colour.pl  -- Prolog syntax colouring support.
prolog_config.pl
prolog_config/2	Get information on the configuration of the current Prolog system.
prolog_dump_runtime_variables/0	Dump the current configuration in shell format.
prolog_coverage.pl  -- Coverage analysis tool
prolog_debug.pl
debug_control_hook/1	Allow user-hooks in the Prolog debugger interaction.
debugging/0	Report current status of the debugger.
debugging_hook/1	Multifile hook that is called as forall(debugging_hook(DebugMode), true) and that may be used to extend the information printed from other debugging libraries.
exception_hook/5	Trap exceptions and consider whether or not to start the tracer.
nospy/1	Set/clear spy-points.
nospyall/0	Set/clear spy-points.
notrap/1	Install a trap on error(Formal, Context) exceptions that unify.
spy/1	Set/clear spy-points.
trap/1	Install a trap on error(Formal, Context) exceptions that unify.
trap_alias/2	Define short hands for commonly used exceptions.
prolog_deps.pl
file_auto_import/2	Update the autoload/2 directives for File.
file_autoload_directives/3	Compute the dependencies as autoload/2 directives.
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/2	True when MetaSpec is a meta-predicate specifier for the predicate Head.
inferred_meta_predicate/2	True when MetaSpec is an inferred meta-predicate specification for Head.
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  -- Wrapping predicates
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
qpforeign.pl
load_foreign_files/0	Calls make_foreign_wrapper_file(+File), compiles the wrapper and loads the predicates.
load_foreign_files/2	Calls make_foreign_wrapper_file(+File), compiles the wrapper and loads the predicates.
load_foreign_files/3	Calls make_foreign_wrapper_file(+File), compiles the wrapper and loads the predicates.
load_foreign_resource/2	Load a foreign module.
make_foreign_resource_wrapper/3	Create a wrapper-file for the given foreign resource.
make_foreign_wrapper_file/1	Just output the wrapper file to the named .c file.
make_foreign_wrapper_file/2	Just output the wrapper file to the named .c file.
make_shared_object/3	Generate a wrapper and link it using plld to the given SharedObject.
qsave.pl  -- Save current program as a state or executable
quasi_quotations.pl  -- Define Quasi Quotation syntax
quintus.pl  -- Quintus compatibility
random.pl  -- Random numbers
rbtrees.pl  -- Red black trees
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.
readln.pl
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
statistics.pl  -- Get information about resource usage
call_time/2	Call Goal as call/1, unifying Time with a dict that provides information on the resource usage.
call_time/3	Call Goal as call/1, unifying Time with a dict that provides information on the resource usage.
statistics/0	Print information about resource usage using print_message/2.
statistics/1	Stats is a dict representing the same information as statistics/0.
thread_statistics/2	Obtain statistical information about a single thread.
time/1	Execute Goal, reporting statistics to the user.
streams.pl  -- Manage Prolog streams
strings.pl  -- String utilities
system.pl  -- System utilities
tables.pl  -- XSB interface to tables
tableutil.pl  -- Table inspection and statistics utilities
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.
call_in_thread/3	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  -- Graph manipulation library
url.pl  -- Analysing and constructing URL
utf8.pl  -- UTF-8 encoding/decoding on lists of character codes.
varnumbers.pl  -- Utilities for numbered terms
vm.pl  -- SWI-Prolog Virtual Machine utilities
wfs.pl  -- Well Founded Semantics interface
when.pl
when/2	Execute Goal when Condition is satisfied.
writef.pl
swritef/2	Use writef/1 or writef/2 and write the result to a string.
swritef/3	Use writef/1 or writef/2 and write the result to a string.
writef/1	Formatted write to the current_output.
writef/2	Formatted write to the current_output.
www_browser.pl  -- Open a URL in the users browser
yall.pl
//2	Shorthand for Free/[]>>Lambda.
//3	Shorthand for Free/[]>>Lambda.
//4	Shorthand for Free/[]>>Lambda.
//5	Shorthand for Free/[]>>Lambda.
//6	Shorthand for Free/[]>>Lambda.
//7	Shorthand for Free/[]>>Lambda.
//8	Shorthand for Free/[]>>Lambda.
//9	Shorthand for Free/[]>>Lambda.
>>/2	Calls a copy of Lambda.
>>/3	Calls a copy of Lambda.
>>/4	Calls a copy of Lambda.
>>/5	Calls a copy of Lambda.
>>/6	Calls a copy of Lambda.
>>/7	Calls a copy of Lambda.
>>/8	Calls a copy of Lambda.
>>/9	Calls a copy of Lambda.
is_lambda/1	True if Term is a valid Lambda expression.
lambda_calls/2	Goal is the goal called if call/N is applied to LambdaExpression, where ExtraArgs are the additional arguments to call/N.
lambda_calls/3	Goal is the goal called if call/N is applied to LambdaExpression, where ExtraArgs are the additional arguments to call/N.
zip.pl  -- Access resource ZIP archives