]>
Chapter0
Chapter 0: Introduction to Axiom
0.1 Introduction to Axiom
0.1.1 Symbolic Computation
0.1.2 Numeric Computation
0.1.3 Graphics
0.1.4 HyperDoc
0.1.5 Interactive Programming
0.1.6 Data Structures
0.1.7 Mathematical Structures
0.1.8 Pattern Matching
0.1.9 Polymorphic Algorithms
0.1.10 Extensibility
0.2 A Technical Introduction
0.2.1 Types are Defined by Abstract Datatype Programs
0.2.2 The Type of Basic Objects is a Domain or Subdomain
0.2.3 Domains Have Types Called Categories
0.2.4 Operations Can Refer To Abstract Types
0.2.5 Categories Form Hierarchies
0.2.6 Domains Belong to Categories by Assertion
0.2.7 Packages Are Clusters of Polymorphic Operations
0.2.8 The Interpreter Builds Domains Dynamically
0.2.9 Axiom Code is Compiled
0.2.10 Axiom is Extensible
0.3 Using Axiom as a Pocket Calculator
0.3.1 Basic Arithmetic
0.3.2 Type Conversion
0.3.3 Useful Functions
0.4 Using Axiom as a Symbolic Calculator
0.4.1 Expressions Involving Symbols
0.4.2 Complex Numbers
0.4.3 Number Representations
0.4.4 Modular Arithmetic
0.5 General Points about Axiom
0.5.1 Computation Without Output
0.5.2 Accessing Earlier Results
0.5.3 Splitting Expressions Over Several Lines
0.5.4 Comments and Descriptions
0.5.5 Control of Result Types
0.6 Data Structures in Axiom
0.6.1 Lists
0.6.2 Segmented Lists
0.6.3 Streams
0.6.4 Arrays, Vectors, Strings, and Bits
0.6.5 Flexible Arrays
0.7 Functions, Choices, and Loops
0.7.1 Reading Code from a File
0.7.2 Blocks
0.7.3 Functions
0.7.4 Choices
0.7.5 Loops
0.7.5.1 The repeat loop
0.7.5.2 The while loop
0.7.5.3 The for loop