library

Prolog files

aggregate.pl  -- Aggregation operators on backtrackable predicates
ansi_term.pl  -- Print decorated text to ANSI consoles
apply.pl  -- Apply predicates on a list
apply_macros.pl  -- Goal expansion rules to avoid meta-calling
apply_macros_sentinel/0	Used to detect that library(apply_macros) is loaded into the current context explicitly.
expand_phrase/2	Provide goal-expansion for PhraseGoal.
expand_phrase/4	Provide goal-expansion for PhraseGoal.
arithmetic.pl  -- Extensible arithmetic
assoc.pl  -- Binary associations
atom.pl  -- Operations on atoms
backcomp.pl
$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_ln/1
base32.pl  -- Base32 encoding and decoding
base64.pl  -- Base64 encoding and decoding
broadcast.pl
broadcast/1	Broadcast given event.
broadcast_request/1	Broadcast given event till accepted.
listen/2	Open a channel for listening for events of the given `Templ'.
listen/3	Open a channel for listening for events of the given `Templ'.
listening/3	returns currently open channels.
unlisten/1	Destroy a channel.
unlisten/2	Destroy a channel.
unlisten/3	Destroy a channel.
charsio.pl
atom_to_chars/2	Convert Atom into a list of character codes.
atom_to_chars/3	Convert Atom into a difference list of character codes.
format_to_chars/3	Use format/2 to write to a list of character codes.
format_to_chars/4	Use format/2 to write to a difference list of character codes.
number_to_chars/2	Convert Atom into a list of character codes.
number_to_chars/3	Convert Number into a difference list of character codes.
open_chars_stream/2	Open Codes as an input stream.
read_from_chars/2	Read Codes into Term.
read_term_from_chars/3	Read Codes into Term.
with_output_to_chars/2	Run Goal as with once/1.
with_output_to_chars/3	Run Goal as with once/1.
with_output_to_chars/4	Same as with_output_to_chars/3 using an explicit stream.
write_to_chars/2	Write a term to a code list.
write_to_chars/3	Write a term to a code list.
check.pl  -- Consistency checking
codesio.pl  -- I/O on Lists of Character Codes
coinduction.pl  -- Co-Logic Programming
csv.pl
csv/3	Prolog DCG to `read/write' CSV data.
csv/4	Prolog DCG to `read/write' CSV data.
csv_options/2	Compiled is the compiled representation of the CSV processing options as they may be passed into csv//2, etc.
csv_read_file/2	Read a CSV file into a list of rows.
csv_read_file/3	Read a CSV file into a list of rows.
csv_read_file_row/3	True when Row is a row in File.
csv_read_row/3	Read the next CSV record from Stream and unify the result with Row.
csv_read_stream/3	Read CSV data from Stream.
csv_write_file/2	Write a list of Prolog terms to a CSV file.
csv_write_file/3	Write a list of Prolog terms to a CSV file.
csv_write_stream/3	Write the rows in Data to Stream.
ctypes.pl  -- Character code classification
is_digit/3	Succeeds if `C' is a digit using `Base' as base and `Weight' represents its value.
is_paren/2	True if Open is the open-parenthesis of Close.
to_lower/2	Downcase a character code.
to_upper/2	Upcase a character code.
upper_lower/2	True when U is the character code of an uppercase character and L is the character code of the corresponding lowercase character.
date.pl  -- Process dates and times
debug.pl
assertion_failed/2	This hook is called if the Goal of assertion/1 fails.
debug_print_hook/3	Hook called by debug/3.
assertion/1	Acts similar to C assert() macro.
debug/1	Add/remove a topic from being printed.
debug/3	Format a message if debug topic is enabled.
debug_message_context/1	Specify additional context for debug messages.
debugging/1	Examine debug topics.
debugging/2	Examine debug topics.
list_debug_topics/0	List currently known topics for debug/3 and their setting.
list_debug_topics/1	List currently known topics for debug/3 and their setting.
nodebug/1	Add/remove a topic from being printed.
dialect.pl
expects_dialect/1	Tell Prolog all subsequent code to the end of the file or the next :- expects_dialect/1 directive is written for the indicated Dialect.
source_exports/2	True if Source exports Export.
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
dif/2	Constraint that expresses that Term1 and Term2 never become identical (==/2).
edinburgh.pl
debug/0	Switch on/off debug mode.
display/1	Write a term, ignoring operators and special syntax constructs such as brace terms ({a}) and lists ([a,b,c]).
display/2	Write a term, ignoring operators and special syntax constructs such as brace terms ({a}) and lists ([a,b,c]).
fileerrors/2	Query and change the fileerrors flag.
nodebug/0	Switch on/off debug mode.
reconsult/1	Load source file(s), wiping the old content first.
unknown/2	Edinburgh Prolog predicate for dealing dealing with undefined procedures.
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
ht_del/3	Delete Key-Value from HT.
ht_gen/3	True when Key-Value is in HT.
ht_get/3	True when Key is in HT and associated with Value.
ht_is_hashtable/1	True when HT is a hash table.
ht_keys/2	True when Keys is an ordered set of all keys in HT.
ht_new/1	Create a new hash table.
ht_pairs/2	True when Pairs and HT represent the same association.
ht_put/3	Add a Key-Value to HT.
ht_put/5	Add Key-Value to HT.
ht_put_new/3	As ht_put/3, but fails if Key is already in HT instead of updating the associated value.
ht_size/2	True when Size is the number of key-value pairs in HT.
ht_update/4	True when HT holds Key-Old before and Key-New after this call.
heaps.pl
add_to_heap/4	Adds Key with priority Priority to Heap0, constructing a new heap in Heap.
delete_from_heap/4	Deletes Key from Heap0, leaving its priority in Priority 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 Priority-Key from Heap0.
heap_size/2	Determines the number of elements in Heap.
heap_to_list/2	Constructs a list List of Priority-Element 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 Priority-Element terms, constructs a heap out of List.
merge_heaps/3	Merge the two heaps Heap0 and Heap1 in Heap.
min_of_heap/3	Unifies Key with the minimum-priority element of Heap and Priority 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 Priority-Key.
help.pl  -- Text based manual
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
macros.pl
expand_macros/5	Perform macro expansion on TermIn with layout PosIn to produce TermOut with layout PosOut.
include_macros/3	Include macros from another module.
macro_position/1	True when Position is the position of the macro.
main.pl  -- Provide entry point for scripts
make.pl  -- Reload modified source files
modules.pl
current_temporary_module/1	True when we are executing in the given temporary module context.
in_temporary_module/3	Run Goal on temporary loaded sources and discard the module and loaded predicates after completion.
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
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
pop_operators/0	Revert all changes to the operator table realised since the last push_operators/1.
pop_operators/1	Reset operators as pushed by push_operators/2.
push_op/3	As op/3, but this call must appear between push_operators/1 and pop_operators/0.
push_operators/1	Installs the operators from New, where New is a list of op(Prec, Type, :Name).
push_operators/2	Installs the operators from New, where New is a list of op(Prec, Type, :Name).
option.pl
dict_options/2	Convert between an option list and a dictionary.
merge_options/3	Merge two option sets.
meta_options/3	Perform meta-expansion on options that are module-sensitive.
option/2	Get an Option from Options.
option/3	Get an Option from Options.
select_option/3	Get and remove Option from Options.
select_option/4	Get and remove Option with default value.
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
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
print_term/2	Pretty print a Prolog term.
predicate_options.pl  -- Access and analyse predicate options
prolog_autoload.pl  -- Autoload all dependencies
prolog_breakpoints.pl
breakpoint_property/2	True when Property is a property of the breakpoint Id.
delete_breakpoint/1	Delete breakpoint with given Id.
set_breakpoint/4	Put a breakpoint at the indicated source-location.
set_breakpoint/5	Put a breakpoint at the indicated source-location.
set_breakpoint_condition/2	Set a condition for of the breakpoint with given Id.
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
body_term_calls/2	True when BodyTerm calls Goal.
comma_list/2	True if CommaList is a nested term over the ','/2 (';'/2) functor and List is a list expressing the elements of the conjunction.
extend_goal/3	Extend the possibly qualified Goal0 with additional arguments from Extra.
head_name_arity/3	Similar to functor/3, but deals with SWI-Prolog's zero-argument callable terms and avoids creating a non-callable term if Name is not an atom and Arity is zero.
is_control_goal/1	True if Goal is a compiled Prolog control structure.
is_predicate_indicator/1	True when Term is a predicate indicator.
mkconj/3	Create a conjunction or disjunction from two terms.
mkdisj/3	Create a conjunction or disjunction from two terms.
most_general_goal/2	General is the most general version of Goal.
pi_head/2	Translate between a PredicateIndicator and a Goal term.
predicate_label/2	Create a human-readable label for the given predicate indicator.
predicate_sort_key/2	Key is the (module-free) name of the predicate for sorting purposes.
semicolon_list/2	True if CommaList is a nested term over the ','/2 (';'/2) functor and List is a list expressing the elements of the conjunction.
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
cov_load_data/2	Reload coverage data from File.
cov_property/1	True when coverage analysis satisfies Property.
cov_reset/0	Discard all collected coverage data.
cov_save_data/2	Save the coverage information to File.
coverage/1	As call(Goal), collecting coverage information while Goal is running.
coverage/2	Collect and optionally report coverage by Goal.
report_hook/2	This hook is called after the data collection.
show_coverage/1	Show collected coverage data.
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_format.pl
format_spec/2	Parse a format string.
format_spec/3	DCG for parsing format strings.
format_types/2	True when Format requires an argument list with terms of the type specified by Types.
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
pack_info/1	Print more detailed information about Pack.
pack_install/1	Install one or more packs from SpecOrList.
pack_install/2	Install one or more packs from SpecOrList.
pack_install_local/3	Install a number of packages in a local directory.
pack_list/1	Query package server and installed packages and display results.
pack_list/2	Query package server and installed packages and display results.
pack_list_installed/0	List currently installed packages and report possible dependency issues.
pack_property/2	True when Property is a property of an installed Pack.
pack_publish/2	Publish a package.
pack_rebuild/0	Rebuild possible foreign components of Pack.
pack_rebuild/1	Rebuild possible foreign components of Pack.
pack_remove/1	Remove the indicated package.
pack_remove/2	Remove the indicated package.
pack_search/1	Query package server and installed packages and display results.
pack_upgrade/1	Upgrade Pack.
pack_url_file/2	True if File is a unique id for the referenced pack and version.
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
cmp_versions/3	Compare to versions.
require_prolog_version/2	Claim that the running Prolog version is at least version Required and provides the requested Features.
require_version/3	Require Component to have version CmpRequired, while Component is know to have version Available.
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  -- Prolog cross-referencer data collection
pure_input.pl
lazy_list_character_count/3	True when CharCount is the current character count in the Lazy list.
lazy_list_location/3	Determine current (error) location in a lazy list.
phrase_from_file/2	Process the content of File using the DCG rule Grammar.
phrase_from_file/3	As phrase_from_file/2, providing additional Options.
phrase_from_stream/2	Run Grammer against the character codes on Stream.
stream_to_lazy_list/2	Create a lazy list representing the character codes in Stream.
syntax_error/3	Throw the syntax error Error at the current location of the input.
qsave.pl
arch_shlib/3	This is a user defined hook called by qsave_program/2.
qsave_program/1	Make a saved state in file `File'.
qsave_program/2	Make a saved state in file `File'.
qsave_toplevel/0	Called to handle `-c file` compilaton.
quasi_quotations.pl  -- Define Quasi Quotation syntax
quintus.pl
abs/2	Unify `Absolute' with the absolute value of `Number'.
acos/2	Math library predicates.
asin/2	Math library predicates.
atan/2	Math library predicates.
atan2/3	Math library predicates.
atom_char/2	Same as ISO char_code/2.
ceiling/2	Math library predicates.
compile/1	Compile files.
cos/2	Math library predicates.
current_stream/3	SICStus/Quintus and backward compatible predicate.
date/1	Get current date as date(Y,M,D).
floor/2	Math library predicates.
genarg/3	Generalised version of ISO arg/3.
log/2	Math library predicates.
log10/2	Math library predicates.
midstring/3	Too difficult to explain.
midstring/4	Too difficult to explain.
midstring/5	Too difficult to explain.
midstring/6	Too difficult to explain.
no_style_check/1	Same as SWI-Prolog style_check(-Style).
on_exception/3
otherwise/0	For (A -> B ; otherwise -> C).
pow/3	Math library predicates.
prolog_flag/2	Same as ISO current_prolog_flag/2.
raise_exception/1	Quintus compatible exception handling.
round/2	Math library predicates.
sign/2	Math library predicates.
simple/1	Term is atomic or a variable.
sin/2	Math library predicates.
skip_line/0	Skip the rest of the current line (on Stream).
skip_line/1	Skip the rest of the current line (on Stream).
sqrt/2	Math library predicates.
stream_position/3	True when Old is the current position in Stream and the stream has been repositioned to New.
tan/2	Math library predicates.
unix/1	This predicate provides a partial emulation of the corresponding Quintus predicate.
random.pl
getrand/1	Query/set the state of the random generator.
maybe/0	Succeed/fail with equal probability (variant of maybe/1).
maybe/1	Succeed with probability P, fail with probability 1-P.
maybe/2	Succeed with probability K/N (variant of maybe/1).
random/1	Binds R to a new random float in the open interval (0.0,1.0).
random/3	Generate a random integer or float in a range.
random_between/3	Binds R to a random integer in [L,U] (i.e., including both L and U).
random_member/2	X is a random member of List.
random_numlist/4	Unify List with an ascending list of integers between L and U (inclusive).
random_perm2/4	Does X=A,Y=B or X=B,Y=A with equal probability.
random_permutation/2	Permutation is a random permutation of List.
random_select/3	Randomly select or insert an element.
random_subseq/3	Selects a random subsequence Subseq of List, with Complement containing all elements of List that were not selected.
randseq/3	S is a list of K unique random integers in the range 1..N.
randset/3	S is a sorted list of K unique random integers in the range 1..N.
setrand/1	Query/set the state of the random generator.
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.
readln.pl
readutil.pl  -- Read utilities
record.pl
current_record/2	True if Name is the name of a record defined in the module associated with Term and Term is the user-provided record declaration.
current_record_predicate/2	True if PI is the predicate indicator for an access predicate to Record.
record/1	Define access predicates for a compound-term.
rwlocks.pl  -- Read/write locks
sandbox.pl  -- Sandboxed Prolog code
settings.pl
convert_setting_text/3	Converts from textual form to Prolog Value.
current_setting/1	True if Setting is a currently defined setting.
env/2	Evaluate environment variables on behalf of arithmetic expressions.
env/3	Evaluate environment variables on behalf of arithmetic expressions.
list_settings/0	List settings to current_output.
list_settings/1	List settings to current_output.
load_settings/1	Load local settings from File.
load_settings/2	Load local settings from File.
restore_setting/1	Restore the value of setting Name to its default.
save_settings/0	Save modified settings to File.
save_settings/1	Save modified settings to File.
set_setting/2	Change a setting.
set_setting_default/2	Change the default for a setting.
setting/2	True when Name is a currently defined setting with Value.
setting/4	Define a setting.
setting_property/2	Query currently defined settings.
shell.pl  -- Elementary shell commands
shlib.pl  -- Utility library for loading foreign objects (DLLs, shared objects)
solution_sequences.pl
call_nth/2	True when Goal succeeded for the Nth time.
distinct/1	True if Goal is true and no previous solution of Goal bound Witness to the same value.
distinct/2	True if Goal is true and no previous solution of Goal bound Witness to the same value.
group_by/4	Group bindings of Template that have the same value for By.
limit/2	Limit the number of solutions.
offset/2	Ignore the first Count solutions.
order_by/2	Order solutions according to Spec.
reduced/1	Similar to distinct/1, but does not guarantee unique results in return for using a limited amount of memory.
reduced/3	Similar to distinct/1, but does not guarantee unique results in return for using a limited amount of memory.
sort.pl
statistics.pl
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
with_output_to/3	Run Goal and once/1 while capturing all output to all streams (current_output, user_output and user_error) in the string Output.
strings.pl  -- String utilities
system.pl  -- System utilities
tables.pl
abolish_table_call/1	Same as abolish_table_subgoals/1.
abolish_table_call/2	Same as abolish_table_subgoals/1.
abolish_table_pred/1	Invalidates all tabled subgoals for the predicate denoted by the predicate or term indicator Pred.
abolish_table_subgoals/2	Behaves as abolish_table_subgoals/1, but allows the default table_gc_action to be over-ridden with a flag, which can be either abolish_tables_transitively or abolish_tables_singly.
get_call/3	True when Trie is an answer trie for a variant of CallTerm.
get_calls/3	True when Trie is an answer trie for a variant that unifies with CallTerm and Skeleton is the answer skeleton.
get_residual/2	True if CallTerm appears in a table and has DelayList.
get_returns/2	True when Return is an answer template for the AnswerTrie.
get_returns/3	True when Return is an answer template for the AnswerTrie and the answer is represented by the trie node NodeID.
get_returns_and_dls/3	True when Return appears in AnswerTrie with the given DelayLists.
get_returns_and_tvs/3	Identical to get_returns/2, but also obtains the truth value of a given answer, setting TruthValue to t if the answer is unconditional and to u if it is conditional.
get_returns_for_call/2	True if AnswerTerm appears in the tables for the variant CallTerm.
set_pil_off/0	Dummy predicates for XSB compatibility.
set_pil_on/0	Dummy predicates for XSB compatibility.
t not/1	Tabled negation.
tfindall/3	This predicate emerged in XSB in an attempt to provide a safer alternative to findall/3.
terms.pl  -- Term manipulation
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
create_pool/1	Hook to create a thread pool lazily.
current_thread_pool/1	True if Name refers to a defined thread pool.
thread_create_in_pool/4	Create a thread in Pool.
thread_pool_create/3	Create a pool of threads.
thread_pool_destroy/1	Destroy the thread pool named Name.
thread_pool_property/2	True if Property is a property of thread pool Name.
worker_exitted/3	It is possible that '__thread_pool_manager' no longer exists while closing down the process because the manager was killed before the worker.
threadutil.pl  -- Interactive thread utilities
tty.pl
menu/3	Show a menu.
tty_clear/0	Clear the display.
tty_flash/0	Give visual signal if possible, otherwise beep.
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
max_var_number/3	True when Max is the max of Start and the highest numbered $VAR(N) term.
numbervars/1	Number variables in Term using $VAR(N).
varnumbers/2	Inverse of numbervars/1.
varnumbers/3	Inverse of numbervars/3.
varnumbers_names/3	If Term is a term with numbered and named variables using the reserved term '$VAR'(X), Copy is a copy of Term where each '$VAR'(X) is consistently replaced by a fresh variable and Bindings is a list X = Var, relating the X terms with the variable it is mapped to.
wfs.pl  -- Well Founded Semantics interface
when.pl  -- Conditional coroutining
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
with_zipper/2	Run Goal while holding ownership over Zipper.
zip_close/1	Close a zipper.
zip_close/2	Close a zipper.
zip_open/4	Create a Zipper, providing access to File.
zipper_file_info/3	Obtain information about the current zip entry.
zipper_goto/2	Seek Zipper to a specified entry.
zipper_members/2	True when Members is the list of file names in the Zipper.
zipper_open_current/3	Open the current entry as an input stream.