- 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
- shlib.pl -- Utility library for loading foreign objects (DLLs, shared objects)
- option.pl
- thread_pool.pl -- Resource bounded thread management
- gensym.pl -- Generate unique symbols
- settings.pl -- Setting management
- arithmetic.pl
- main.pl
- readutil.pl -- Read utilities
- operators.pl -- Manage operators
- pairs.pl -- Operations on key-value lists
- prolog_source.pl -- Examine Prolog source-files
- quasi_quotations.pl
- url.pl -- Analysing and constructing URL
- www_browser.pl
- 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
- solution_sequences.pl -- Modify solution sequences
- atom.pl -- Operations on atoms
- prolog_pack.pl -- A package manager for Prolog
- git.pl -- Run GIT commands
- ctypes.pl -- Character code classification
- utf8.pl
- base64.pl
- persistency.pl -- Provide persistent dynamic predicates
- pure_input.pl
- nb_set.pl -- Non-backtrackable sets
- aggregate.pl
- csv.pl -- Process CSV (Comma-Separated Values) data
- iostream.pl -- Utilities to deal with streams
- dialect.pl
- 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
- predicate_options.pl -- Access and analyse predicate options
- rbtrees.pl
- nb_rbtrees.pl
- sandbox.pl
- prolog_format.pl -- Analyse format specifications
- random.pl -- Random numbers
- pprint.pl -- Pretty Print Prolog terms
- modules.pl -- Module utility predicates
- lazy_lists.pl
- edinburgh.pl
- prolog_clause.pl
- prolog_breakpoints.pl -- Manage Prolog break-points
- dicts.pl
- heaps.pl
- backcomp.pl -- Backward compatibility
- date.pl
- prolog_profile.pl -- Execution profiler
- listing.pl -- List programs and pretty print clauses
- quintus.pl -- Quintus compatibility
- oset.pl -- Ordered set manipulation
- varnumbers.pl
- tables.pl -- XSB interface to tables
- charsio.pl
- terms.pl -- Term manipulation
- make.pl -- Reload modified source files
- streams.pl -- Manage Prolog streams
- rwlocks.pl -- Read/write locks
- threadutil.pl -- Interactive thread utilities
- wfs.pl
- prolog_stack.pl -- Examine the Prolog stack
- check.pl -- Consistency checking
- intercept.pl -- Intercept and signal interface
- prolog_coverage.pl -- Coverage analysis tool
- prolog_debug.pl -- User level debugging tools
- increval.pl -- Incremental dynamic predicate modification
- help.pl -- Text based manual
- portray_text.pl
- statistics.pl -- Get information about resource usage
- optparse.pl -- command line parsing
- ansi_term.pl
- hashtable.pl -- Hash tables
- coinduction.pl -- Co-Logic Programming
- qsave.pl
- zip.pl
- prolog_history.pl -- Per-directory persistent commandline history
- codesio.pl -- I/O on Lists of Character Codes
- shell.pl -- Elementary shell commands
- when.pl -- Conditional coroutining
- system.pl -- System utilities
- prolog_jiti.pl
- prolog_codewalk.pl -- Prolog code walker
- exceptions.pl -- Exception classification
- base32.pl
- sort.pl
- prolog_versions.pl -- Demand specific (Prolog) versions
- edit.pl
- macros.pl -- Macro expansion
- prolog_autoload.pl -- Autoload all dependencies
- writef.pl -- Old-style formatted write
- strings.pl -- String utilities
- tableutil.pl
- tty.pl
- prolog_config.pl
- explain.pl
- fastrw.pl
- prolog_trace.pl
- files.pl
- prolog_wrap.pl -- Wrapping predicates
- prolog_metainference.pl -- Infer meta-predicate properties
- prolog_qlfmake.pl -- Compile the library to QLF format
- 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.