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  -- 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
codesio.pl  -- I/O on Lists of Character Codes
coinduction.pl  -- Co-Logic Programming
csv.pl  -- Process CSV (Comma-Separated Values) data
date.pl  -- Process dates and times
debug.pl  -- Print debug messages and test assertions
dialect.pl  -- Support multiple Prolog dialects
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  -- The dif/2 constraint
edinburgh.pl  -- Some traditional Edinburgh predicates
error.pl
fastrw.pl  -- Fast reading and writing of terms
gensym.pl  -- Generate unique symbols
git.pl  -- Run GIT commands
heaps.pl  -- heaps/priority queues
intercept.pl  -- Intercept and signal interface
iostream.pl  -- Utilities to deal with streams
lazy_lists.pl  -- Lazy list handling
listing.pl
listing/0	Lists all predicates defined in the calling module.
listing/1	List matching clauses.
listing/2	List matching clauses.
portray_clause/1	Portray `Clause' on the current output stream.
portray_clause/2	Portray `Clause' on the current output stream.
portray_clause/3	Portray `Clause' on the current output stream.
lists.pl
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.
main.pl  -- Provide entry point for scripts
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.
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
pairs.pl  -- Operations on key-value lists
persistency.pl  -- Provide persistent dynamic predicates
pio.pl  -- Pure I/O
pprint.pl  -- Pretty Print Prolog terms
predicate_options.pl  -- Access and analyse predicate options
prolog_breakpoints.pl  -- Manage Prolog break-points
prolog_clause.pl
prolog_code.pl  -- Utilities for reasoning about code
prolog_colour.pl  -- Prolog syntax colouring support.
prolog_coverage.pl  -- Coverage analysis tool
prolog_format.pl  -- Analyse format specifications
prolog_pack.pl  -- A package manager for Prolog
prolog_profile.pl  -- Execution profiler
prolog_source.pl  -- Examine Prolog source-files
prolog_stack.pl  -- Examine the Prolog stack
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  -- Pure Input from files and streams
quasi_quotations.pl  -- Define Quasi Quotation syntax
random.pl  -- Random numbers
rbtrees.pl  -- Red black trees
readln.pl
readutil.pl  -- Read utilities
record.pl  -- Access compound arguments by name
sandbox.pl
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
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
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
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  -- 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
//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.