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
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  -- I/O on Lists of Character Codes
check.pl  -- Consistency checking
codesio.pl
format_to_codes/3	Use format/2 to write to a list of character codes.
format_to_codes/4	Use format/2 to write to a difference list of character codes.
open_codes_stream/2	Open Codes as an input stream.
read_from_codes/2	Read Codes into Term.
read_term_from_codes/3	Read Codes into Term.
with_output_to_codes/2	Run Goal with as once/1.
with_output_to_codes/3	Run Goal with as once/1.
with_output_to_codes/4	As with_output_to_codes/3, but Stream is unified with the temporary stream.
write_term_to_codes/3	True when Codes is a string that matches the output of write_term/3 using Options.
write_term_to_codes/4	True when Codes\Tail is a difference list containing the character codes that matches the output of write_term/3 using Options.
write_to_codes/2	Codes is a list of character codes produced by write/1 on Term.
write_to_codes/3	Codes is a difference-list of character codes produced by write/1 on Term.
coinduction.pl  -- Co-Logic Programming
csv.pl  -- Process CSV (Comma-Separated Values) data
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
date_time_value/3	Extract values from a date-time structure.
day_of_the_week/2	Computes the day of the week for a given date.
day_of_the_year/2	Computes the day of the year for a given date.
parse_time/2	Stamp is a timestamp created from parsing Text using the representation Format.
parse_time/3	Stamp is a timestamp created from parsing Text using the representation Format.
debug.pl  -- Print debug messages and test assertions
dialect.pl  -- Support multiple Prolog dialects
dicts.pl  -- Dict utilities
dif.pl
dif/2	Constraint that expresses that Term1 and Term2 never become identical (==/2).
edinburgh.pl  -- Some traditional Edinburgh predicates
error.pl
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 reading and writing of terms
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  -- 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
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  -- 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
make/0	Reload all source files that have been changed since they were loaded.
make_reload_file/1	Reload file into the proper module.
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
occurs.pl  -- Finding and counting sub-terms
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  -- Option list processing
optparse.pl  -- command line parsing
ordsets.pl  -- Ordered set manipulation
oset.pl
oset_addel/3	Ordered set element addition.
oset_delel/3	Ordered set element deletion.
oset_diff/3	Ordered set difference.
oset_dint/2	Distributed intersection.
oset_dunion/2	Distributed union.
oset_int/3	ordered set intersection.
oset_is/1	check that OSet in correct format (standard order).
oset_power/2	True when PSet is the powerset of Set.
oset_union/3	Union is the union of OSet1 and OSet2.
pairs.pl  -- Operations on key-value lists
persistency.pl  -- Provide persistent dynamic predicates
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_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_coverage.pl  -- Coverage analysis tool
prolog_debug.pl  -- User level debugging tools
prolog_format.pl  -- Analyse format specifications
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
profile/1	Run once(Goal) under the execution profiler.
profile/2	Run once(Goal) under the execution profiler.
profile_data/1	Gather all relevant data from profiler.
profile_procedure_data/2	Collect data for Pred.
show_profile/1	Display last collected profiling data.
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_xref.pl  -- Prolog cross-referencer data collection
pure_input.pl  -- Pure Input from files and streams
quasi_quotations.pl  -- Define Quasi Quotation syntax
quintus.pl  -- Quintus compatibility
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.
readutil.pl  -- Read utilities
record.pl  -- Access compound arguments by name
sandbox.pl
settings.pl  -- Setting management
shell.pl
cd/0	Change working directory.
cd/1	Change working directory.
dirs/0	Manage the directory stack:.
file_style/2	True when File should be listed as a terminal hyperlink.
ls/0	Listing similar to Unix =ls -F=, flagging directories with =/=.
ls/1	Listing similar to Unix =ls -F=, flagging directories with =/=.
mv/2	Move (Rename) a file.
popd/0	Manage the directory stack:.
pushd/0	Manage the directory stack:.
pushd/1	Manage the directory stack:.
pwd/0	Print current working directory.
rm/1	Remove (unlink) a file.
shell/0	Execute an interactive shell.
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
strings.pl  -- String utilities
system.pl
lock_predicate/1	Transform a predicate into a system predicate.
system_mode/1	Switch the system into system or user mode.
system_module/0	Any predicate defined after this declaraction uptil the end of the file will become a system predicate.
unlock_predicate/1	Transform a system predicate into a normal system predicate.
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
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
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
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  -- Lambda expressions
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.