aggregate.pl -- Aggregation operators on backtrackable predicates |
|---|
| ansi_term.pl -- Print decorated text to ANSI consoles |
|---|
| 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 |
|---|
| identifier_parts/2 | Parts is a list of atoms that make up Identifier. | |
| join_identifier_parts/3 | Join parts of an identifier according to Style. | |
| restyle_identifier/3 | Restyle an identifier by extracting the alnum substrings and joining them together according to Style. | |
| backcomp.pl -- Backward compatibility |
|---|
| base32.pl -- Base32 encoding and decoding |
|---|
| base64.pl |
|---|
| base64/2 | Equivalent to base64_encoded/3 using the options as(atom) and encoding(iso_latin_1). | |
| base64/3 | Encode/decode list of character codes using base64. | |
| base64_encoded/3 | General the base64 encoding and decoding. | |
| base64_encoded/4 | | |
| base64url/2 | Translates between plaintext and base64url encoded atom or string. | |
| base64url/3 | Encode/decode list of character codes using Base64URL. | |
| 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 |
|---|
| csv.pl |
|---|
| csv/3 | Prolog DCG to `read/write' CSV data. | |
| csv/4 | Prolog DCG to `read/write' CSV data. | |
| csv_options/2 | Compiled is the compiled representation of the CSV processing options as they may be passed into csv//2, etc. | |
| csv_read_file/2 | Read a CSV file into a list of rows. | |
| csv_read_file/3 | Read a CSV file into a list of rows. | |
| csv_read_file_row/3 | True when Row is a row in File. | |
| csv_read_row/3 | Read the next CSV record from Stream and unify the result with Row. | |
| csv_read_stream/3 | Read CSV data from Stream. | |
| csv_write_file/2 | Write a list of Prolog terms to a CSV file. | |
| csv_write_file/3 | Write a list of Prolog terms to a CSV file. | |
| csv_write_stream/3 | Write the rows in Data to Stream. | |
| 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 |
|---|
| gensym.pl -- Generate unique symbols |
|---|
| git.pl -- Run GIT commands |
|---|
| hashtable.pl -- Hash tables |
|---|
| heaps.pl -- heaps/priority queues |
|---|
| help.pl |
|---|
| apropos/1 | Print objects from the manual whose name or summary match with Query. | |
| help/0 | Show help for What. | |
| help/1 | Show help for What. | |
| help_text/2 | When Predicate is a term of the form Name/Arity for which documentation exists, HelpText is the documentation in textual format (parsed from the HTML help). | |
| show_html_hook/1 | Hook called to display the extracted HTML document. | |
| increval.pl |
|---|
| incr_directly_depends/2 | True if Goal1 depends on Goal2 in the IDG. | |
| incr_invalid_subgoals/1 | List is a sorted list (set) of the incremental subgoals that are currently invalid. | |
| incr_invalidate_call/1 | This is the XSB name, but the manual says incr_invalidate_calls/1 and the comment with the code suggests this is misnamed. | |
| incr_invalidate_calls/1 | Invalidate all tables for subgoals of Goal as well as tables that are affected by these. | |
| incr_propagate_calls/1 | Activate the monotonic answer propagation similarly to when a new fact is asserted for a monotonic dynamic predicate. | |
| incr_table_update/0 | Updated all invalid tables. | |
| incr_trans_depends/2 | True for each pair in the transitive closure of incr_directly_depends(G1, G2). | |
| is_incremental_subgoal/1 | This predicate non-deterministically unifies Subgoal with incrementally tabled subgoals that are currently table entries. | |
| 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 -- List Manipulation |
|---|
| main.pl |
|---|
| argv_options/3 | Parse command line arguments. | |
| argv_options/4 | As argv_options/3 in guided mode, Currently this version allows parsing argument options throwing an exception rather than calling halt/1 by passing an empty list to ParseOptions. | |
| argv_usage/1 | Use print_message/2 to print a usage message at Level. | |
| cli_debug_opt_help/2 | Implements opt_type/3, opt_help/2 and opt_meta/2 for debug arguments. | |
| cli_debug_opt_meta/2 | Implements opt_type/3, opt_help/2 and opt_meta/2 for debug arguments. | |
| cli_debug_opt_type/3 | Implements opt_type/3, opt_help/2 and opt_meta/2 for debug arguments. | |
| cli_enable_development_system/0 | Re-enable the development environment. | |
| cli_parse_debug_options/2 | Parse certain commandline options for debugging and development purposes. | |
| main/0 | Call main/1 using the passed command-line arguments. | |
| make.pl -- Reload modified source files |
|---|
| modules.pl -- Module utility predicates |
|---|
| occurs.pl -- Finding and counting sub-terms |
|---|
| operators.pl |
|---|
| pop_operators/0 | Revert all changes to the operator table realised since the last push_operators/1. | |
| pop_operators/1 | Reset operators as pushed by push_operators/2. | |
| push_op/3 | As op/3, but this call must appear between push_operators/1 and pop_operators/0. | |
| push_operators/1 | Installs the operators from New, where New is a list of op(Prec, Type, :Name). | |
| push_operators/2 | Installs the operators from New, where New is a list of op(Prec, Type, :Name). | |
| 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 |
|---|
| 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_deps.pl |
|---|
| file_auto_import/2 | Update the autoload/2 directives for File. | |
| file_autoload_directives/3 | Compute the dependencies as autoload/2 directives. | |
| prolog_format.pl -- Analyse format specifications |
|---|
| prolog_jiti.pl -- Just In Time Indexing (JITI) utilities |
|---|
| prolog_metainference.pl |
|---|
| infer_meta_predicate/2 | True when MetaSpec is a meta-predicate specifier for the predicate Head. | |
| inferred_meta_predicate/2 | True when MetaSpec is an inferred meta-predicate specification for Head. | |
| prolog_pack.pl -- A package manager for Prolog |
|---|
| prolog_profile.pl |
|---|
| profile/1 | Run once(Goal) under the execution profiler. | |
| profile/2 | Run once(Goal) under the execution profiler. | |
| profile_data/1 | Gather all relevant data from profiler. | |
| profile_procedure_data/2 | Collect data for Pred. | |
| show_profile/1 | Display last collected profiling data. | |
| 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 |
|---|
| qsave.pl -- Save current program as a state or executable |
|---|
| quasi_quotations.pl -- Define Quasi Quotation syntax |
|---|
| quintus.pl -- Quintus compatibility |
|---|
| random.pl |
|---|
| getrand/1 | Query/set the state of the random generator. | |
| maybe/1 | Succeed with probability P, fail with probability 1-P. | |
| random/1 | Binds R to a new random float in the open interval (0.0,1.0). | |
| random/3 | Generate a random integer or float in a range. | |
| random_between/3 | Binds R to a random integer in [L,U] (i.e., including both L and U). | |
| random_member/2 | X is a random member of List. | |
| random_numlist/4 | Unify List with an ascending list of integers between L and U (inclusive). | |
| random_perm2/4 | Does X=A,Y=B or X=B,Y=A with equal probability. | |
| random_permutation/2 | Permutation is a random permutation of List. | |
| random_subseq/3 | Selects a random subsequence Subseq of List, with Complement containing all elements of List that were not selected. | |
| randseq/3 | S is a list of K unique random integers in the range 1..N. | |
| randset/3 | S is a sorted list of K unique random integers in the range 1..N. | |
| setrand/1 | Query/set the state of the random 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. | |
| 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 |
|---|
| 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 |
|---|
| ugraphs.pl -- Graph manipulation library |
|---|
| url.pl -- Analysing and constructing URL |
|---|
| utf8.pl -- UTF-8 encoding/decoding on lists of character codes. |
|---|
| varnumbers.pl |
|---|
| max_var_number/3 | True when Max is the max of Start and the highest numbered $VAR(N) term. | |
| varnumbers/3 | Inverse of numbervars/3. | |
| varnumbers_names/3 | If Term is a term with numbered and named variables using the reserved term '$VAR'(X), Copy is a copy of Term where each '$VAR'(X) is consistently replaced by a fresh variable and Bindings is a list X = Var, relating the X terms with the variable it is mapped to. | |
| vm.pl |
|---|
| clause_vm/2 | True when VM is the virtual machine code of ClauseRef. | |
| vm_list/1 | Lists the definition of the predicates matching Spec to current_output. | |
| vmi_labels/2 | Translated between a raw and a labeled representation for a VMI sequence as produced by clause_vm/2. | |
| wfs.pl -- Well Founded Semantics interface |
|---|
| when.pl -- Conditional coroutining |
|---|
| www_browser.pl -- Open a URL in the users browser |
|---|
| yall.pl -- Lambda expressions |
|---|
| zip.pl -- Access resource ZIP archives |
|---|