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
arithmetic.pl
arithmetic_expression_value/2	True when Result unifies with the arithmetic result of evaluating Expression.
arithmetic_function/1	Declare a predicate as an arithmetic function.
assoc.pl  -- Binary associations
atom.pl
identifier_parts/2	Parts is a list of atoms that make up Identifier.
join_identifier_parts/3	Join parts of an identifier according to Style.
restyle_identifier/3	Restyle an identifier by extracting the alnum substrings and joining them together according to Style.
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  -- 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
coinductive/1	The declaration :- coinductive name/arity, ... defines predicates as coinductive.
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
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
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.
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
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
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).
pairs.pl  -- Operations on key-value lists
persistency.pl  -- Provide persistent dynamic predicates
pio.pl  -- Pure I/O
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
prolog_code.pl  -- Utilities for reasoning about code
prolog_codewalk.pl
prolog_program_clause/2	True when ClauseRef is a reference for clause in the program.
prolog_walk_code/1	Walk over all loaded (user) Prolog code.
subterm_pos/5	True when SubTerm is a sub term of Term, compared using Cmp, TermPosition describes the term layout of Term and SubTermPos describes the term layout of SubTerm.
prolog_colour.pl  -- Prolog syntax colouring support.
prolog_config.pl  -- Provide configuration information
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_format.pl  -- Analyse format specifications
prolog_history.pl
prolog_history/1	Execute Action on the history.
prolog_jiti.pl
jiti_list/0	List the JITI (Just In Time Indexes) of selected predicates.
jiti_list/1	List the JITI (Just In Time Indexes) of selected predicates.
jiti_suggest_modes/0	Propose modes for the predicates referenced by Spec.
jiti_suggest_modes/1	Propose modes for the predicates referenced by Spec.
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
backtrace/1	Get and print a stacktrace to the user_error stream.
get_prolog_backtrace/2	Obtain a backtrace from the current location.
get_prolog_backtrace/3	Obtain a backtrace from the current location.
print_last_choicepoint/0	Print details on the last open choice point.
print_last_choicepoint/2
print_prolog_backtrace/2	Print a stacktrace in human readable form to Stream.
print_prolog_backtrace/3	Print a stacktrace in human readable form to Stream.
prolog_stack_frame_property/2	True when Property is a property of Frame.
stack_guard/1	Dynamic multifile hook that is normally not defined.
stack_guard/1	Dynamic multifile predicate.
prolog_trace.pl
list_tracing/0	List predicates we are currently tracing.
notraceall/0	Remove all trace points.
trace/1	Print passes through ports of specified predicates.
trace/2	Print passes through ports of specified predicates.
tracing/2	True if Spec is traced using Ports.
prolog_versions.pl  -- Demand specific (Prolog) versions
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
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  -- Save current program as a state or executable
quasi_quotations.pl  -- Define Quasi Quotation syntax
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  -- Elementary shell commands
shlib.pl
compat_arch/2	User definable hook to establish if Arch1 is compatible with Arch2 when running a shared object.
current_foreign_library/2	Query currently loaded shared libraries.
load_foreign_library/1	Load a shared object or DLL.
load_foreign_library/2	Load a shared object or DLL.
reload_foreign_libraries/0	Reload all foreign libraries loaded (after restore of a state created using qsave_program/2.
unload_foreign_library/1	Unload a shared object or DLL.
unload_foreign_library/2	Unload a shared object or DLL.
use_foreign_library/1	Load and install a foreign library as load_foreign_library/1,2 and register the installation using initialization/2 with the option now.
use_foreign_library/2	Load and install a foreign library as load_foreign_library/1,2 and register the installation using initialization/2 with the option now.
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
streams.pl  -- Manage Prolog streams
strings.pl  -- String utilities
system.pl  -- System utilities
tables.pl  -- XSB interface to tables
terms.pl  -- Term manipulation
thread.pl
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
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
expand_url_path/2	Expand URL specifications similar to absolute_file_name/3.
known_browser/2	True if browser FileBaseName has a remote protocol compatible to Compatible.
www_open_url/1	Open URL in running version of the users' browser or start a new 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.