aggregate.pl -- Aggregation operators on backtrackable predicates |
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 |
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 |
date.pl -- Process dates and times |
debug.pl |
| assertion_failed/2 | This hook is called if the Goal of assertion/1 fails. | |
| debug_print_hook/3 | Hook called by debug/3. |  |
| assertion/1 | Acts similar to C assert() macro. |  |
| debug/1 | Add/remove a topic from being printed. |  |
| debug/3 | Format a message if debug topic is enabled. |  |
| debug_message_context/1 | Specify additional context for debug messages. |  |
| debugging/1 | Examine debug topics. |  |
| debugging/2 | Examine debug topics. |  |
| list_debug_topics/0 | List currently known topics for debug/3 and their setting. |  |
| list_debug_topics/1 | List currently known topics for debug/3 and their setting. |  |
| nodebug/1 | Add/remove a topic from being printed. |  |
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 |
fastrw.pl -- Fast reading and writing of terms |
gensym.pl -- Generate unique symbols |
git.pl -- Run GIT commands |
heaps.pl -- heaps/priority queues |
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 |
main.pl -- Provide entry point for scripts |
make.pl -- Reload modified source files |
modules.pl -- Module utility predicates |
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 |
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_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 code walker |
prolog_colour.pl -- Prolog syntax colouring support. |
prolog_config.pl |
| prolog_config/2 | Get information on the configuration of the current Prolog system. |  |
| prolog_dump_runtime_variables/0 | Dump the current configuration in shell format. |  |
prolog_coverage.pl -- Coverage analysis tool |
prolog_debug.pl -- User level debugging tools |
prolog_format.pl -- Analyse format specifications |
prolog_pack.pl -- A package manager for Prolog |
prolog_source.pl -- Examine Prolog source-files |
prolog_stack.pl -- Examine the Prolog stack |
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 -- Pure Input from files and streams |
quasi_quotations.pl -- Define Quasi Quotation syntax |
random.pl -- Random numbers |
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 -- Utility library for loading foreign objects (DLLs, shared objects) |
solution_sequences.pl -- Modify solution sequences |
sort.pl |
statistics.pl -- Get information about resource usage |
strings.pl -- String utilities |
system.pl -- System utilities |
terms.pl -- Term manipulation |
thread_pool.pl -- Resource bounded thread management |
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 |
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 |