aggregate.pl -- Aggregation operators on backtrackable predicates |
|---|
| apply.pl |
|---|
| 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/2 | Translates between plaintext and base32 encoded atom or string. | |
| base32/3 | Encode/decode list of character codes using base32. | |
| 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 |
|---|
| coinductive/1 | The declaration :- coinductive name/arity, ... defines predicates as coinductive. | |
| csv.pl -- Process CSV (Comma-Separated Values) data |
|---|
| date.pl |
|---|
| date_time_value/3 | Extract values from a date-time structure. | |
| day_of_the_week/2 | Computes the day of the week for a given date. | |
| day_of_the_year/2 | Computes the day of the year for a given date. | |
| parse_time/2 | Stamp is a timestamp created from parsing Text using the representation Format. | |
| parse_time/3 | Stamp is a timestamp created from parsing Text using the representation Format. | |
| 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 |
|---|
| gensym.pl -- Generate unique symbols |
|---|
| git.pl -- Run GIT commands |
|---|
| hashtable.pl -- Hash tables |
|---|
| heaps.pl -- heaps/priority queues |
|---|
| 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 |
|---|
| macros.pl -- Macro expansion |
|---|
| 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 |
|---|
| 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 |
|---|
| breakpoint_property/2 | True when Property is a property of the breakpoint Id. | |
| delete_breakpoint/1 | Delete breakpoint with given Id. | |
| set_breakpoint/4 | Put a breakpoint at the indicated source-location. | |
| set_breakpoint/5 | Put a breakpoint at the indicated source-location. | |
| set_breakpoint_condition/2 | Set a condition for of the breakpoint with given Id. | |
| prolog_clause.pl |
|---|
| prolog_code.pl -- Utilities for reasoning about code |
|---|
| prolog_codewalk.pl |
|---|
| prolog_program_clause/2 | True when ClauseRef is a reference for clause in the program. | |
| prolog_walk_code/1 | Walk over all loaded (user) Prolog code. | |
| subterm_pos/5 | True when SubTerm is a sub term of Term, compared using Cmp, TermPosition describes the term layout of Term and SubTermPos describes the term layout of SubTerm. | |
| prolog_colour.pl |
|---|
| prolog_colourise_query/3 | Colourise a query, to be executed in the context of SourceId. | |
| prolog_colourise_stream/3 | Determine colour fragments for the data on Stream. | |
| prolog_colourise_stream/4 | Determine colour fragments for the data on Stream. | |
| prolog_colourise_term/4 | Colourise the next term on Stream. | |
| syntax_colour/2 | True when a range classified Class must be coloured using Attributes. | |
| vararg_goal_classification/3 | Multifile hookable classification for vararg predicates. | |
| prolog_config.pl -- Provide configuration information |
|---|
| prolog_debug.pl -- User level debugging tools |
|---|
| prolog_format.pl -- Analyse format specifications |
|---|
| prolog_history.pl -- Per-directory persistent commandline history |
|---|
| prolog_metainference.pl -- Infer meta-predicate properties |
|---|
| 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 -- 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 |
|---|
| convert_setting_text/3 | Converts from textual form to Prolog Value. | |
| current_setting/1 | True if Setting is a currently defined setting. | |
| env/2 | Evaluate environment variables on behalf of arithmetic expressions. | |
| env/3 | Evaluate environment variables on behalf of arithmetic expressions. | |
| list_settings/0 | List settings to current_output. | |
| list_settings/1 | List settings to current_output. | |
| load_settings/1 | Load local settings from File. | |
| load_settings/2 | Load local settings from File. | |
| restore_setting/1 | Restore the value of setting Name to its default. | |
| save_settings/0 | Save modified settings to File. | |
| save_settings/1 | Save modified settings to File. | |
| set_setting/2 | Change a setting. | |
| set_setting_default/2 | Change the default for a setting. | |
| setting/2 | True when Name is a currently defined setting with Value. | |
| setting/4 | Define a setting. | |
| setting_property/2 | Query currently defined settings. | |
| 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 |
|---|
| system.pl -- System utilities |
|---|
| tables.pl -- XSB interface to tables |
|---|
| terms.pl -- Term manipulation |
|---|
| thread_pool.pl -- Resource bounded thread management |
|---|
| threadutil.pl -- Interactive thread utilities |
|---|
| 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 |
|---|
| www_browser.pl -- Open a URL in the users browser |
|---|
| yall.pl -- Lambda expressions |
|---|