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
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  -- Support entering toplevel queries
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
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
files.pl
gensym.pl  -- Generate unique symbols
git.pl  -- Run GIT commands
hashtable.pl  -- Hash tables
heaps.pl  -- heaps/priority queues
help.pl  -- Text based manual
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
obfuscate.pl  -- Code obfuscating
occurs.pl  -- Finding and counting sub-terms
operators.pl  -- Manage operators
option.pl  -- Option list processing
optparse.pl  -- command line parsing
ordsets.pl  -- Ordered set manipulation
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
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
evaluable_property/2	True when Property is a property of the evaluable function Function.
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
prolog_locale.pl  -- Tweak the locale for Prolog development
prolog_metainference.pl  -- Infer meta-predicate properties
prolog_pack.pl  -- A package manager for Prolog
prolog_profile.pl  -- Execution profiler
prolog_qlfmake.pl  -- Compile the library to QLF format
prolog_source.pl  -- Examine Prolog source-files
prolog_stack.pl  -- Examine the Prolog stack
prolog_trace.pl  -- Print access to predicates
prolog_versions.pl  -- Demand specific (Prolog) versions
prolog_wrap.pl  -- Wrapping predicates
prolog_xref.pl  -- Prolog cross-referencer data collection
pure_input.pl  -- Pure Input from files and streams
qpforeign.pl  -- Quintus compatible foreign loader
load_foreign_files/0	Calls make_foreign_wrapper_file(+File), compiles the wrapper and loads the predicates.
load_foreign_files/2	Calls make_foreign_wrapper_file(+File), compiles the wrapper and loads the predicates.
load_foreign_files/3	Calls make_foreign_wrapper_file(+File), compiles the wrapper and loads the predicates.
load_foreign_resource/2	Load a foreign module.
make_foreign_resource_wrapper/3	Create a wrapper-file for the given foreign resource.
make_foreign_wrapper_file/1	Just output the wrapper file to the named .c file.
make_foreign_wrapper_file/2	Just output the wrapper file to the named .c file.
make_shared_object/3	Generate a wrapper and link it using plld to the given SharedObject.
qsave.pl  -- Save current program as a state or executable
quasi_quotations.pl  -- Define Quasi Quotation syntax
quintus.pl  -- Quintus compatibility
random.pl  -- Random numbers
random_terms.pl  -- Random term generator
rbtrees.pl  -- Red black trees
is_rbtree/1	True if Term is a valid Red-Black tree.
list_to_rbtree/2	Tree is the red-black tree corresponding to the mapping in List, which should be a list of Key-Value pairs.
ord_list_to_rbtree/2	Tree is the red-black tree corresponding to the mapping in list List, which should be a list of Key-Value pairs.
rb_apply/4	If the value associated with key Key is Val0 in Tree, and if call(G,Val0,ValF) holds, then NewTree differs from Tree only in that Key is associated with value ValF in tree NewTree.
rb_clone/3	`Clone' the red-back tree TreeIn into a new tree TreeOut with the same keys as the original but with all values set to unbound values.
rb_del_max/4	Delete the largest element from the tree Tree, returning the key Key, the value Val associated with the key and a new tree NewTree.
rb_del_min/4	Delete the least element from the tree Tree, returning the key Key, the value Val associated with the key and a new tree NewTree.
rb_delete/3	Delete element with key Key from the tree Tree, returning the value Val associated with the key and a new tree NewTree.
rb_delete/4	Same as rb_delete(Tree, Key, NewTree), but also unifies Val with the value associated with Key in Tree.
rb_empty/1	Succeeds if Tree is an empty Red-Black tree.
rb_fold/4	Fold the given predicate over all the key-value pairs in Tree, starting with initial state State0 and returning the final state State.
rb_in/3	True when Key-Value is a key-value pair in red-black tree Tree.
rb_insert/4	Add an element with key Key and Value to the tree Tree creating a new red-black tree NewTree.
rb_insert_new/4	Add a new element with key Key and Value to the tree Tree creating a new red-black tree NewTree.
rb_keys/2	Keys is unified with an ordered list of all keys in the Red-Black tree Tree.
rb_lookup/3	True when Value is associated with Key in the Red-Black tree Tree.
rb_map/2	True if call(Goal, Value) is true for all nodes in T.
rb_map/3	For all nodes Key in the tree Tree, if the value associated with key Key is Val0 in tree Tree, and if call(G,Val0,ValF) holds, then the value associated with Key in NewTree is ValF.
rb_max/3	Key is the maximal key in Tree, and is associated with Val.
rb_min/3	Key is the minimum key in Tree, and is associated with Val.
rb_new/1	Create a new Red-Black tree Tree.
rb_next/4	Next is the next element after Key in Tree, and is associated with Val.
rb_partial_map/4	For all nodes Key in Keys, if the value associated with key Key is Val0 in tree Tree, and if call(G,Val0,ValF) holds, then the value associated with Key in NewTree is ValF, otherwise it is the value associated with the key in Tree.
rb_previous/4	Previous is the previous element after Key in Tree, and is associated with Val.
rb_size/2	Size is the number of elements in Tree.
rb_update/4	Tree NewTree is tree Tree, but with value for Key associated with NewVal.
rb_update/5	Same as rb_update(Tree, Key, NewVal, NewTree) but also unifies OldVal with the value associated with Key in Tree.
rb_visit/2	Pairs is an infix visit of tree Tree, where each element of Pairs is of the form Key-Value.
rb_visit_range/4	Retrieves a range of pairs with keys between Min and Max (inclusive) from a Tree using standard term comparison.
readln.pl  -- Read line as list of tokens
readutil.pl  -- Read utilities
read_file_to_codes/3	Read the file Spec into a list of Codes.
read_file_to_string/3	Read the file Spec into a the string String.
read_file_to_terms/3	Read the file Spec into a list of terms.
read_line_to_codes/2	Read the next line of input from Stream.
read_line_to_codes/3	Difference-list version to read an input line to a list of character codes.
read_line_to_string/2	Read the next line from Stream into String.
read_stream_to_codes/2	Read input from Stream to a list of character codes.
read_stream_to_codes/3	Read input from Stream to a list of character codes.
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
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
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.
tableutil.pl  -- Table inspection and statistics utilities
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
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
yall.pl  -- Lambda expressions
zip.pl  -- Access resource ZIP archives