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 -- 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 -- I/O on Lists of Character Codes |
|---|
| 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 -- 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 |
|---|
| error.pl |
|---|
| current_encoding/1 | True if Name is the name of a supported encoding. | |
| current_type/3 | True when Type is a currently defined type and Var satisfies Type of the body term Body succeeds. | |
| domain_error/2 | The argument is of the proper type, but has a value that is outside the supported values. | |
| existence_error/2 | Culprit is of the correct type and correct domain, but there is no existing (external) resource of type ObjectType that is represented by it. | |
| existence_error/3 | Culprit is of the correct type and correct domain, but there is no existing (external) resource of type ObjectType that is represented by it in the provided set. | |
| has_type/2 | True if Term satisfies Type. | |
| instantiation_error/1 | An argument is under-instantiated. | |
| is_of_type/2 | True if Term satisfies Type. | |
| must_be/2 | True if Term satisfies the type constraints for Type. | |
| permission_error/3 | It is not allowed to perform Operation on (whatever is represented by) Culprit that is of the given PermissionType (in fact, the ISO Standard is confusing and vague about these terms' meaning). | |
| representation_error/1 | A representation error indicates a limitation of the implementation. | |
| resource_error/1 | A goal cannot be completed due to lack of resources. | |
| syntax_error/1 | A text has invalid syntax. | |
| type_error/2 | Tell the user that Culprit is not of the expected ValidType. | |
| uninstantiation_error/1 | An argument is over-instantiated. | |
| gensym.pl -- Generate unique symbols |
|---|
| git.pl -- Run GIT commands |
|---|
| hashtable.pl -- Hash tables |
|---|
| heaps.pl -- heaps/priority queues |
|---|
| help.pl -- Text based manual |
|---|
| 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 |
|---|
| modules.pl -- Module utility predicates |
|---|
| occurs.pl -- Finding and counting sub-terms |
|---|
| operators.pl -- Manage operators |
|---|
| 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 -- 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_format.pl -- Analyse format specifications |
|---|
| 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_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_xref.pl -- Prolog cross-referencer data collection |
|---|
| pure_input.pl -- Pure Input from files and streams |
|---|
| quasi_quotations.pl -- Define Quasi Quotation syntax |
|---|
| quintus.pl -- Quintus compatibility |
|---|
| 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 |
|---|
| tables.pl -- XSB interface to tables |
|---|
| terms.pl -- Term manipulation |
|---|
| thread.pl -- High level thread primitives |
|---|
| thread_pool.pl -- Resource bounded thread management |
|---|
| ugraphs.pl -- Graph manipulation library |
|---|
| url.pl -- Analysing and constructing URL |
|---|
| utf8.pl |
|---|
| utf8_codes/3 | DCG translating between a Unicode code-list and its UTF-8 encoded byte-string. | |
| varnumbers.pl -- Utilities for numbered terms |
|---|
| wfs.pl -- Well Founded Semantics interface |
|---|
| when.pl -- Conditional coroutining |
|---|
| www_browser.pl -- Open a URL in the users browser |
|---|
| yall.pl -- Lambda expressions |
|---|