- swipl
- library
- error.pl
- debug.pl -- Print debug messages and test assertions
- apply.pl
- lists.pl
- broadcast.pl -- Event service
- predicate_options.pl
- shlib.pl
- option.pl
- thread_pool.pl
- gensym.pl
- settings.pl -- Setting management
- arithmetic.pl
- main.pl -- Provide entry point for scripts
- readutil.pl
- operators.pl -- Manage operators
- pairs.pl -- Operations on key-value lists
- prolog_source.pl -- Examine Prolog source-files
- quasi_quotations.pl -- Define Quasi Quotation syntax
- url.pl -- Analysing and constructing URL
- www_browser.pl -- Open a URL in the users browser
- prolog_colour.pl
- record.pl -- Access compound arguments by name
- prolog_xref.pl -- Prolog cross-referencer data collection
- occurs.pl -- Finding and counting sub-terms
- ordsets.pl -- Ordered set manipulation
- assoc.pl -- Binary associations
- ugraphs.pl -- Graph manipulation library
- iostream.pl -- Utilities to deal with streams
- atom.pl -- Operations on atoms
- prolog_pack.pl -- A package manager for Prolog
- solution_sequences.pl -- Modify solution sequences
- git.pl -- Run GIT commands
- ctypes.pl -- Character code classification
- utf8.pl -- UTF-8 encoding/decoding on lists of character codes.
- base64.pl -- Base64 encoding and decoding
- persistency.pl -- Provide persistent dynamic predicates
- pure_input.pl -- Pure Input from files and streams
- nb_set.pl -- Non-backtrackable sets
- aggregate.pl -- Aggregation operators on backtrackable predicates
- csv.pl -- Process CSV (Comma-Separated Values) data
- dialect.pl -- Support multiple Prolog dialects
- apply_macros.pl -- Goal expansion rules to avoid meta-calling
- yall.pl -- Lambda expressions
- prolog_code.pl -- Utilities for reasoning about code
- dif.pl -- The dif/2 constraint
- thread.pl -- High level thread primitives
- rbtrees.pl -- Red black trees
- nb_rbtrees.pl -- Non-backtrackable operations on red black trees
- random.pl -- Random numbers
- sandbox.pl -- Sandboxed Prolog code
- prolog_format.pl -- Analyse format specifications
- pprint.pl -- Pretty Print Prolog terms
- modules.pl -- Module utility predicates
- lazy_lists.pl -- Lazy list handling
- edinburgh.pl -- Some traditional Edinburgh predicates
- prolog_clause.pl -- Get detailed source-information about a clause
- prolog_breakpoints.pl -- Manage Prolog break-points
- dicts.pl -- Dict utilities
- backcomp.pl -- Backward compatibility
- quintus.pl -- Quintus compatibility
- prolog_wrap.pl -- Wrapping predicates
- optparse.pl -- command line parsing
- make.pl -- Reload modified source files
- prolog_profile.pl -- Execution profiler
- ansi_term.pl -- Print decorated text to ANSI consoles
- listing.pl -- List programs and pretty print clauses
- terms.pl -- Term manipulation
- strings.pl -- String utilities
- tables.pl -- XSB interface to tables
- intercept.pl -- Intercept and signal interface
- when.pl -- Conditional coroutining
- threadutil.pl -- Interactive thread utilities
- date.pl -- Process dates and times
- prolog_stack.pl -- Examine the Prolog stack
- hashtable.pl -- Hash tables
- system.pl -- System utilities
- oset.pl -- Ordered set manipulation
- prolog_versions.pl -- Demand specific (Prolog) versions
- prolog_debug.pl -- User level debugging tools
- varnumbers.pl -- Utilities for numbered terms
- increval.pl -- Incremental dynamic predicate modification
- writef.pl -- Old-style formatted write
- wfs.pl -- Well Founded Semantics interface
- tty.pl -- Terminal operations
- prolog_coverage.pl -- Coverage analysis tool
- base32.pl -- Base32 encoding and decoding
- charsio.pl -- I/O on Lists of Character Codes
- codesio.pl -- I/O on Lists of Character Codes
- coinduction.pl -- Co-Logic Programming
- heaps.pl -- heaps/priority queues
- sort.pl
- statistics.pl -- Get information about resource usage
- exceptions.pl -- Exception classification
- files.pl
- check.pl -- Consistency checking
- macros.pl -- Macro expansion
- library
- comma_list(?CommaList, ?List)
- semicolon_list(?SemicolonList, ?List)
- True if CommaList is a nested term over the ','/2 (';'/2) functor
and List is a list expressing the elements of the conjunction. The
predicate is deterministic if at least CommaList or List is
sufficiently instantiated. If both are partial structures it
enumerates ever growing conjunctions and lists. CommaList may be
left or right associative on input. When generated, the CommaList is
always right associative.
This predicate is typically used to reason about Prolog conjunctions (disjunctions) as many operations are easier on lists than on binary trees over some operator.