SICStus Prolog User's Manual

by the Intelligent Systems Laboratory

Swedish Institute of Computer Science

PO Box 1263

SE-164 29 Kista, Sweden

Release 3.7.1

October 1998

• Introduction
• Acknowledgments
• Notational Conventions
  • Keyboard Characters
  • Mode Spec
  • Predicate Spec
  • Development and Runtime Systems
  • Function Prototypes
  • ISO Compliance
• How to Run Prolog
  • Getting Started
    • Finding Libraries at Runtime
    • Environment Variables
  • Reading in Programs
  • Inserting Clauses at the Terminal
  • Directives: Queries and Commands
    • Queries
    • Commands
  • Syntax Errors
  • Undefined Predicates
  • Program Execution And Interruption
  • Exiting From The Top-Level
  • Nested Executions--Break and Abort
  • Saving and Restoring Program States
  • Emacs Interface
    • Customizing Emacs
    • Basic Configuration
    • Usage
    • Mode Line
    • Configuration
    • Tips
      • Font-locking
      • Auto-fill mode
      • Speed
      • Changing Colors
• The Prolog Language
  • Syntax, Terminology and Informal Semantics
    • Terms
      • Integers
      • Floats
      • Atoms
      • Variables
      • Compound Terms
    • Programs
  • Declarative Semantics
  • Procedural Semantics
  • Occurs-Check
  • The Cut Symbol
  • Operators
  • Syntax Restrictions
  • Comments
• Running Prolog in Parallel
  • Introduction
  • Running a Parallel Example
  • Main Issues of Parallel Execution
    • The Muse Model
    • Scheduling
    • Cut, Side Effects and Suspension
  • Visualization Tools
    • Must
    • Visandor
    • Vimust
  • Programming Considerations
• The Module System
  • Basic Concepts
  • Module Prefixing
  • Defining Modules
  • Importation
  • Module Name Expansion
  • Meta-Predicate Declarations
• Loading Programs
  • Predicates which Load Code
  • Declarations
    • Multifile Declarations
    • Dynamic Declarations
    • Volatile Declarations
    • Block Declarations
    • Meta-Predicate Declarations
    • Module Declarations
    • Public Declarations
    • Mode Declarations
    • Parallel and Sequential Declarations
  • Considerations for File-To-File Compilation
• Debugging
  • The Procedure Box Control Flow Model
  • Basic Debugging Predicates
  • Spy-points
  • Format of Debugging messages
  • Options Available during Debugging
  • Consulting during Debugging
  • Catching Exceptions
• Built-In Predicates
  • Input / Output
    • Reading-in Programs
    • Term and Goal Expansion
    • Input and Output of Terms
    • Character Input/Output
    • Stream I/O
    • DEC-10 Prolog File I/O
    • An Example
  • Arithmetic
  • Comparison of Terms
  • Control
  • Error and Exception Handling
  • Information about the State of the Program
  • Meta-Logic
  • Modification of Terms
  • Modification of the Program
  • Internal Database
  • Blackboard Primitives
  • All Solutions
  • Coroutining
  • Debugging
  • Execution Profiling
  • Muse
  • Miscellaneous
• Mixing C and Prolog
  • Notes
  • Calling C from Prolog
    • Foreign Resource and Conversion Declarations
    • Static and Dynamic linking
    • Conversion Declarations
    • Conversions between Prolog Arguments and C Types
    • Interface Predicates
    • Init and Deinit Functions
    • Creating the Linked Foreign Resource
  • Support Functions
    • Creating and Manipulating SP_term_refs
    • Creating Prolog Terms
    • Accessing Prolog Terms
    • Testing Prolog Terms
    • Unifying and Comparing Terms
    • Memory Allocation
  • Calling Prolog from C
    • Finding One Solution of a Call
    • Finding Multiple Solutions of a Call
    • Calling Prolog Asynchronously
    • Exception Handling in C
  • SICStus Streams
    • Prolog Streams
    • Defining a New Stream
      • Low Level I/O Functions
      • Installing a New Stream
      • Internal Representation
    • Hookable Standard Streams
      • Writing User-stream Hooks
      • Writing User-stream Post-hooks
      • User-stream Hook Example
  • Muse Support Functions
  • Hooks
  • Runtime Systems
    • Initializing the Prolog Engine
    • Loading Prolog Code
    • Creating the Executable
    • Running the Executable
  • Development Systems
  • Examples
    • Train Example (connections)
    • I/O on Lists of Character Codes
    • Exceptions from C
    • Stream Example
• Mixing Java and Prolog
  • Prerequisites
  • Calling Java from Prolog
    • Static and Dynamic Linking
    • Declarating Java-methods
  • Conversions between Prolog Arguments and Java Types
    • Calling Java from Prolog: An Example
  • Calling Prolog from Java
  • Jasper Package Class Reference
  • Exception Handling
  • Resources
• Programming Tips and Examples
  • Programming Guidelines
  • Indexing
  • Last Call Optimization
  • If-Then-Else Compilation
  • Programming Examples
    • Simple List Processing
    • Family Example (descendants)
    • Association List Primitives
    • Differentiation
    • Use of Meta-Logical Predicates
    • Use of Term Expansion
    • Prolog in Prolog
    • Translating English Sentences into Logic Formulae
    • Muse FLI Example
• The Prolog Library
• Array Operations
• Association Lists
• Attributed Variables
• Heap Operations
• List Operations
• Term Utilities
• Ordered Set Operations
• Queue Operations
• Random Number Generator
• Operating System Utilities
• Updatable Binary Trees
• Unweighted Graph Operations
• Weighted Graph Operations
• Socket I/O
• Linda--Process Communication
  • Server
  • Client
• External Storage of Terms (External Database)
  • Basics
  • Current Limitations
  • The DB-Spec--Informal Description
  • Predicates
  • An Example Session
  • The Db-Spec
• Boolean Constraint Solver
  • Solver Interface
  • Examples
    • Example 1
    • Example 2
    • Example 3
    • Example 4
• Constraint Logic Programming over Rationals or Reals
  • Introduction
    • Referencing this Software
    • Acknowledgments
  • Solver Interface
    • Notational Conventions
    • Solver Predicates
    • Unification
    • Feedback and Bindings
  • Linearity and Nonlinear Residues
    • How Nonlinear Residues are made to disappear
    • Isolation Axioms
  • Numerical Precision and Rationals
  • Projection and Redundancy Elimination
    • Variable Ordering
    • Turning Answers into Terms
    • Projecting Inequalities
  • Why Disequations
  • Syntactic Sugar
    • Monash Examples
      • Compatibility Notes
  • A Mixed Integer Linear Optimization Example
  • Implementation Architecture
    • Fragments and Bits
      • Rationals
      • Partial Evaluation, Compilation
      • Asserting with Constraints
    • Bugs
• Constraint Logic Programming over Finite Domains
  • Introduction
    • Referencing this Software
    • Acknowledgments
  • Solver Interface
    • Posting Constraints
    • A Constraint Satisfaction Problem
    • Reified Constraints
  • Available Constraints
    • Arithmetic Constraints
    • Membership Constraints
    • Propositional Constraints
    • Combinatorial Constraints
    • User-Defined Constraints
  • Enumeration Predicates
  • Statistics Predicates
  • Answer Constraints
  • The Constraint System
    • Definitions
    • Pitfalls of Interval Reasoning
  • Defining Global Constraints
    • The Global Constraint Programming Interface
    • Reflection Predicates
    • FD Set Operations
    • A Global Constraint Example
  • Defining Primitive Constraints
    • Indexicals
    • Range Expressions
    • Term Expressions
    • Monotonicity of Indexicals
    • FD predicates
    • Execution of Propagating Indexicals
    • Execution of Checking Indexicals
    • Goal Expanded Constraints
  • Example Programs
    • Send More Money
    • N Queens
    • Cumulative Scheduling
  • Syntax Summary
    • Syntax of Indexicals
    • Syntax of Arithmetic Expressions
    • Operator Declarations
• Constraint Handling Rules
  • Copyright
  • Introduction
  • Introductory Examples
  • CHR Library
    • Loading the Library
    • Declarations
    • Constraint Handling Rules, Syntax
    • How CHR work
    • Pragmas
    • Options
    • Built-In Predicates
    • Consulting and Compiling Constraint Handlers
    • Compiler-generated Predicates
    • Operator Declarations
    • Exceptions
  • Debugging CHR Programs
    • Control Flow Model
    • CHR Debugging Predicates
    • CHR Spy-points
    • CHR Debugging Messages
    • CHR Debugging Options
  • Programming Hints
  • Constraint Handlers
  • Backward Compatibility
• Prolog Objects
  • Getting Started
  • Declared Objects
    • Object Declaration
    • Method Declarations
    • Generic Objects for Easy Reuse
  • Self, Message Sending, and Message Delegation
  • Object Hierarchies, Inheritance, and Modules
    • Inheritance
    • Differential Inheritance
    • Use of Modules
    • Super and Sub
    • The Keyword Super
    • Semantic Links to Other Objects
    • Dynamically Declared Objects
    • Dynamic Methods
    • Inheritance of Dynamic Behavior
  • Creating Objects Dynamically
    • Object Creation
    • Method Additions
    • Parameter Passing to New Objects
  • Access Driven Programming--Daemons
  • Instances
  • Built-In Objects and Methods
    • Universal Methods
    • Inlined Methods
    • The Proto-Object "object"
    • The built-in object "utility"
  • Expansion to Prolog Code
    • The Inheritance Mechanism
    • Object Attributes
    • Object Instances
    • The Object Declaration
    • The Method Code
    • Parameter Transfer
  • Examples
    • Classification of Birds
    • Inheritance and Delegation
    • Prolog++ programs
• Generalized Horn Clause Language
• Tcl/Tk Interface
  • Prolog to Tcl
    • Command Format
  • Tcl to Prolog
  • Tk
• The Gauge Profiling Tool
• I/O on Lists of Character Codes
• Jasper
• Glue Code Generator
• Timeout Predicate
• Cross Reference Producer
• Summary of Built-In Predicates
• Full Prolog Syntax
  • Notation
  • Syntax of Sentences as Terms
  • Syntax of Terms as Tokens
  • Syntax of Tokens as Character Strings
  • Escape Sequences
  • Notes
• Standard Operators
• References
• Predicate Index
• Prolog Objects Method Index
• Concept Index

This document was generated on 6 October 1998 using the texi2html translator version 1.52.