- swipl
- library
- error.pl
- debug.pl -- Print debug messages and test assertions
- apply.pl -- Apply predicates on a list
- lists.pl
- broadcast.pl -- Event service
- predicate_options.pl
- shlib.pl -- Utility library for loading foreign objects (DLLs, shared objects)
- option.pl -- Option list processing
- thread_pool.pl -- Resource bounded thread management
- gensym.pl
- settings.pl -- Setting management
- arithmetic.pl -- Extensible arithmetic
- 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
- listing.pl -- List programs and pretty print clauses
- edit.pl -- Editor interface
- backcomp.pl -- Backward compatibility
- writef.pl -- Old-style formatted write
- when.pl -- Conditional coroutining
- statistics.pl -- Get information about resource usage
- prolog_config.pl -- Provide configuration information
- macros.pl -- Macro expansion
- terms.pl -- Term manipulation
- make.pl -- Reload modified source files
- wfs.pl -- Well Founded Semantics interface
- optparse.pl -- command line parsing
- increval.pl -- Incremental dynamic predicate modification
- tables.pl -- XSB interface to tables
- hashtable.pl -- Hash tables
- base32.pl -- Base32 encoding and decoding
- prolog_trace.pl -- Print access to predicates
- prolog_wrap.pl -- Wrapping predicates
- threadutil.pl -- Interactive thread utilities
- prolog_coverage.pl -- Coverage analysis tool
- ansi_term.pl -- Print decorated text to ANSI consoles
- strings.pl -- String utilities
- zip.pl -- Access resource ZIP archives
- codesio.pl -- I/O on Lists of Character Codes
- date.pl -- Process dates and times
- prolog_profile.pl -- Execution profiler
- quintus.pl -- Quintus compatibility
- heaps.pl -- heaps/priority queues
- streams.pl -- Manage Prolog streams
- check.pl -- Consistency checking
- prolog_history.pl -- Per-directory persistent commandline history
- prolog_stack.pl -- Examine the Prolog stack
- prolog_debug.pl -- User level debugging tools
- prolog_codewalk.pl -- Prolog code walker
- charsio.pl -- I/O on Lists of Character Codes
- coinduction.pl -- Co-Logic Programming
- sort.pl
- varnumbers.pl -- Utilities for numbered terms
- fastrw.pl -- Fast reading and writing of terms
- prolog_versions.pl -- Demand specific (Prolog) versions
- prolog_autoload.pl -- Autoload all dependencies
- shell.pl -- Elementary shell commands
- intercept.pl -- Intercept and signal interface
- rwlocks.pl -- Read/write locks
- prolog_jiti.pl -- Just In Time Indexing (JITI) utilities
- prolog_metainference.pl -- Infer meta-predicate properties
- system.pl -- System utilities
- tty.pl -- Terminal operations
- help.pl -- Text based manual
- oset.pl -- Ordered set manipulation
- explain.pl -- Describe Prolog Terms
- portray_text.pl -- Portray text
- files.pl
- win_menu.pl -- Console window menu
- qsave.pl -- Save current program as a state or executable
- library
- in_temporary_module(?Module, :Setup, :Goal)
- Run Goal on temporary loaded sources and discard the module and
loaded predicates after completion. This predicate performs the
following steps:
- If Module is unbound, create a unique identifier for it.
- Turn Module into a temporary module using set_module/1. Note that this requires the module to be non-existent or empty. If Module is specified, it should typically be set to a unique value as obtained from e.g. uuid/1.
- Run Setup in the context of Module.
- If setup succeeded possible choice points are discarded and Goal is started.
The logical result of this predicate is the same as `(Setup@Module -> Goal@Module)`, i.e., both Setup and Goal are resolved relative to the current module, but executed in the context of Module. If Goal must be called in Module, use
call(Goal)
.The module and all its predicates are destroyed after Goal terminates, as defined by setup_call_cleanup/3.
Discussion This predicate is intended to load programs in an isolated environment and reclaim all resources. This unfortunately is incomplete:
- Running the code may leave side effects such as creating records, flags, changing Prolog flags, etc. The system has no provisions to track this.
- So called functors (name/arity pairs) are not yet subject to garbage collection. Functors are both used to define predicates and to create compound terms.
- See also
- - library(sandbox) determines whether unknown goals are safe to call.
- - load_files/2 offers the option
sandboxed(true)
to load code from unknown sources safely.