aggregate.pl -- Aggregation operators on backtrackable predicates |
ansi_term.pl -- Print decorated text to ANSI consoles |
apply.pl -- Apply predicates on a list |
convlist/3 | Similar to maplist/3, but elements for which call(Goal, ElemIn, _) fails are omitted from ListOut. | |
exclude/3 | Filter elements for which Goal fails. | |
foldl/4 | Fold an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("fold-left"), using columns of m list elements as arguments for Goal. | |
foldl/5 | Fold an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("fold-left"), using columns of m list elements as arguments for Goal. | |
foldl/6 | Fold an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("fold-left"), using columns of m list elements as arguments for Goal. | |
foldl/7 | Fold an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("fold-left"), using columns of m list elements as arguments for Goal. | |
include/3 | Filter elements for which Goal succeeds. | |
maplist/2 | True if Goal is successfully applied on all matching elements of the list. | |
maplist/3 | True if Goal is successfully applied on all matching elements of the list. | |
maplist/4 | True if Goal is successfully applied on all matching elements of the list. | |
maplist/5 | True if Goal is successfully applied on all matching elements of the list. | |
partition/4 | Filter elements of List according to Pred. | |
partition/5 | Filter List according to Pred in three sets. | |
scanl/4 | Scan an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("scan-left"), using columns of m list elements as arguments for Goal. | |
scanl/5 | Scan an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("scan-left"), using columns of m list elements as arguments for Goal. | |
scanl/6 | Scan an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("scan-left"), using columns of m list elements as arguments for Goal. | |
scanl/7 | Scan an ensemble of m (0 <= m <= 4) lists of length n head-to-tail ("scan-left"), using columns of m list elements as arguments for Goal. | |
apply_macros.pl -- Goal expansion rules to avoid meta-calling |
arithmetic.pl -- Extensible arithmetic |
assoc.pl -- Binary associations |
atom.pl -- Operations on atoms |
backcomp.pl -- Backward compatibility |
base32.pl -- Base32 encoding and decoding |
base64.pl -- Base64 encoding and decoding |
broadcast.pl -- Event service |
charsio.pl -- I/O on Lists of Character Codes |
check.pl -- Consistency checking |
check_installation.pl -- Check installation issues and features |
codesio.pl -- I/O on Lists of Character Codes |
coinduction.pl -- Co-Logic Programming |
console_input.pl |
csv.pl -- Process CSV (Comma-Separated Values) data |
ctypes.pl -- Character code classification |
date.pl -- Process dates and times |
debug.pl -- Print debug messages and test assertions |
dialect.pl -- Support multiple Prolog dialects |
dicts.pl -- Dict utilities |
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 -- Editor interface |
error.pl -- Error generating support |
exceptions.pl -- Exception classification |
explain.pl -- Describe Prolog Terms |
fastrw.pl -- Fast reading and writing of terms |
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 -- Hash tables |
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 -- Text based manual |
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. | |
show_html_hook/1 | Hook called to display the extracted HTML document. | |
hotfix.pl -- Load hotfixes into executables |
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 |
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. | |
nth0/4 | Select/insert element at index. | |
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. | |
sum_list/2 | Sum is the result of adding all numbers in List. | |
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 -- Non-backtrackable operations on red black trees |
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. | |
obfuscate.pl -- Code obfuscating |
occurs.pl -- Finding and counting sub-terms |
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 -- Manage operators |
option.pl -- Option list processing |
optparse.pl -- command line parsing |
ordsets.pl -- Ordered set manipulation |
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 |
portray_text/1 | Switch portraying on or off. | |
set_portray_text/2 | Set options for portraying. | |
set_portray_text/3 | Set options for portraying. | |
pprint.pl -- Pretty Print Prolog terms |
predicate_options.pl -- Access and analyse predicate options |
prolog_autoload.pl -- Autoload all dependencies |
prolog_breakpoints.pl -- Manage Prolog break-points |
prolog_clause.pl -- Get detailed source-information about a clause |
prolog_code.pl -- Utilities for reasoning about code |
prolog_codewalk.pl -- Prolog code walker |
prolog_colour.pl -- Prolog syntax colouring support. |
prolog_config.pl -- Provide configuration information |
prolog_coverage.pl -- Coverage analysis tool |
prolog_debug.pl -- User level debugging tools |
prolog_deps.pl -- Compute file dependencies |
prolog_evaluable.pl -- Inspect properties of evaluable functions |
prolog_format.pl -- Analyse format specifications |
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 |
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. | |
prolog_locale.pl -- Tweak the locale for Prolog development |
setup_prolog_integer_grouping/0 | This sets up the Prolog toplevel and debugger to write numbers with grouping. | |
prolog_metainference.pl -- Infer meta-predicate properties |
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 |
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 |
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 |
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 -- Print access to predicates |
prolog_versions.pl -- Demand specific (Prolog) versions |
prolog_wrap.pl -- Wrapping predicates |
prolog_xref.pl -- Prolog cross-referencer data collection |
pure_input.pl -- Pure Input from files and streams |
qpforeign.pl -- Quintus compatible foreign loader |
qsave.pl -- Save current program as a state or executable |
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 -- Quintus compatibility |
random.pl -- Random numbers |
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 -- Red black trees |
readln.pl -- Read line as list of tokens |
readutil.pl -- Read utilities |
record.pl -- Access compound arguments by name |
rwlocks.pl -- Read/write locks |
sandbox.pl -- Sandboxed Prolog code |
settings.pl -- Setting management |
shell.pl -- Elementary shell commands |
cd/0 | Change working directory. | |
cd/1 | Change working directory. | |
dirs/0 | Manage the directory stack:. | |
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 -- System utilities |
tables.pl -- XSB interface to tables |
terms.pl -- Term manipulation |
thread.pl -- High level thread primitives |
thread_pool.pl -- Resource bounded thread management |
threadutil.pl -- Interactive thread utilities |
tty.pl -- Terminal operations |
ugraphs.pl -- Graph manipulation library |
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 |
vm.pl -- SWI-Prolog Virtual Machine utilities |
wfs.pl -- Well Founded Semantics interface |
when.pl -- Conditional coroutining |
writef.pl -- Old-style formatted write |
www_browser.pl -- Open a URL in the users browser |
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 |
//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 |
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. | |