[ < ] [ > ]   [ << ] [ Up ] [ >> ]         [Top] [Contents] [Index] [Page Top / Bottom]

Index of Figures

URL="http://www.bookshelf.jp/cgi-bin/goto.cgi?file=onlisp&node=Index+of+Figures"
comment(none) to "onlisp/IndexofFigures"
searchSearchElisp

Jump to:   A   B   C   D   E   F   G   I   L   M   N   O   P   Q   R   S   T   U  

Index Entry Section

A
A directed graph with a loop22.5 Cuts
A function to create objects25.2 Objects in Plain Lisp
A function to return reversed lists3.1 Functional Design
A function to reverse lists3.1 Functional Design
A game of squash11.5 Iteration with Multiple Values
A macro and two depths of expansion7.4 Testing Macroexpansion
A macro defined with and without backquote7.2 Backquote
A macro for defining delimiter read-macros17.3 Delimiters
A macro for testing macroexpansion7.4 Testing Macroexpansion
A macro which sorts its arguments12.4 More Complex Utilities
A network compiled into closures6.1 Networks
A read-macro defining delimiters17.2 Dispatching Macro Characters
A read-macro for constant functions17.1 Macro Characters
A read-macro for functional composition17.3 Delimiters
A sketch of defmacro7.5 Destructuring in Parameter Lists
A typical with- macro11.2 The with- Macro
A very small ATN23.2 The Formalism
Adding support for new operators24.6 Adding Prolog Features
Adding support for new operators24.6 Adding Prolog Features
An asymmetric inversion12.5 Defining Inversions
An I/O loop in Prolog24.7 Examples
An operator for functional composition5.3 Memoizing
Anaphoric variants of Common Lisp operators14.1 Anaphoric Variants
Assertion of sample facts19.3 A Query Interpreter
Automatic definition of abbreviations16.1 Abbreviations
Automatic definition of access macros16.1 Abbreviations
Automatic definition of anaphoric macros16.3 Anaphoric Macros
Auxiliary methods25.2 Objects in Plain Lisp
Auxiliary methods (continued)25.2 Objects in Plain Lisp
Avoiding capture with a closure9.5 Avoiding Capture by Prior Evaluation
Avoiding capture with gensym9.6 Avoiding Capture with Gensyms
Avoiding capture with let9.3 When Capture Occurs

B
Basic database functions19.1 The Database

C
Choice in a subroutine22.2 Search
Code for defining rules24.6 Adding Prolog Features
Code involving rules24.2 An Interpreter
Combination of cond and let11.1 Creating Context
Common Lisp choice in a subroutine22.4 Common Lisp Implementation
Common Lisp functions defined with on-cdrs15.2 Recursion on Cdrs
Compilation of nodes and arcs23.4 An ATN Compiler
Compilation of queries24.5 New Implementation
Compilation with static references6.2 Compiling Networks
Continuation-passing macros20.2 Continuation-Passing Macros
Controlling argument evaluation10.1 Number of Evaluations
Correct choose in Scheme22.6 True Nondeterminism

D
Defining methods25.2 Objects in Plain Lisp
Definitions of a+ and alist16.3 Anaphoric Macros
Desired expansion of do7.7 Macros as Programs
Destructuring on arrays18.2 Other Structures
Destructuring on structures18.2 Other Structures
Deterministic search22.6 True Nondeterminism
Deterministic tree search22.1 The Concept
Diagram used in writing memq7.3 Defining Simple Macros
Diagram used in writing while7.3 Defining Simple Macros
Doubly-recursive list utilities4.4 Search

E
Effect of changing priorities21.2 Implementation
Exhaustive Chocoblob search22.5 Cuts
Expansion of a call to do-tuples/c11.4 Iteration
Expansion of a call to mvdo11.6 Need for Macros
Expansion of a call to sortf12.4 More Complex Utilities
Expansion of a conjunction24.5 New Implementation
Expansion of an if-match18.2 Other Structures
Expansion of nthmost13.1 New Utilities

F
Fast matching operator18.2 Other Structures
Fast matching operator (continued)18.2 Other Structures
File utilities14.3 Referential Transparency
Function for recursion on trees5.6 Recursion on Subtrees
Function for recursion on trees5.6 Recursion on Subtrees
Function for traversing networks6.1 Networks
Function to define flat list recursers5.5 Recursion on Cdrs
Functional syntax25.2 Objects in Plain Lisp
Functions defined using on-trees15.3 Recursion on Subtrees
Functions expressed with lrec5.5 Recursion on Cdrs
Functions expressed with ttrav5.6 Recursion on Subtrees
Functions which operate on symbols and strings4.7 Symbols and Strings
Functions which search lists4.4 Search

G
General function-building macro15.1 Building Functions
General sequence destructuring operator18.2 Other Structures
Graph of a larger ATN23.5 A Sample ATN
Graph of a small ATN23.2 The Formalism

I
I/O functions4.5 Mapping
Implementation of force and delay15.3 Recursion on Subtrees
Implementing do7.7 Macros as Programs
Interpretation of queries24.2 An Interpreter

L
Larger functions that operate on lists4.3 Operations on Lists
Layers of abstraction24.1 Concepts
List operations on generalized variables12.3 New Utilities
Lists as trees5.6 Recursion on Subtrees

M
Macro for generating Bezier curves13.3 Applications
Macro for removing methods25.4 Methods
Macro implementation of let11.1 Creating Context
Macroexpansion of a node function23.4 An ATN Compiler
Macros for conditional evaluation11.2 The with- Macro
Macros for conditional evaluation11.3 Conditional Evaluation
Macros for iteration by subsequences11.4 Iteration
Macros for list recursion15.2 Recursion on Cdrs
Macros for recursion on trees15.3 Recursion on Subtrees
Macros which bind variables11.1 Creating Context
Macros which operate on generalized variables12.2 The Multiple Evaluation Problem
Maintaining parent and child links25.2 Objects in Plain Lisp
Mapping functions4.5 Mapping
Marking and pruning search trees22.5 Cuts
Matching function18.2 Other Structures
Memoizing utility5.2 Orthogonality
Method combination25.2 Objects in Plain Lisp
Method combination (continued)25.2 Objects in Plain Lisp
Mistaken analogy to a recursive function10.4 Recursion
More anaphoric variants14.1 Anaphoric Variants
More complex macros on setf12.4 More Complex Utilities
More function builders5.4 Composing Functions
More general defanaph16.3 Anaphoric Macros
Move and scale filleted8.3 Applications for Macros
Multiple inheritance25.2 Objects in Plain Lisp
Multiple paths to a superclass25.2 Objects in Plain Lisp
Multiple value binding version of do11.6 Need for Macros
Multiple value binding version of do*11.5 Iteration with Multiple Values
Multiple value version of psetq11.5 Iteration with Multiple Values
Multiple-value anaphoric macros14.2 Failure

N
New syntax of rules24.6 Adding Prolog Features
New toplevel macro24.5 New Implementation
New utilities defined with on-cdrs15.2 Recursion on Cdrs
Nominal dictionary23.5 A Sample ATN
Nondeterministic operators in Common Lisp22.4 Common Lisp Implementation
Nondeterministic search22.6 True Nondeterminism
Nondeterministic search in Common Lis22.5 Cuts
Nondeterministic tree search22.1 The Concept
Noun phrase sub-network23.5 A Sample ATN

O
One process with one wait21.2 Implementation
Original move and scale8.3 Applications for Macros

P
Possible definition of '17.1 Macro Characters
Prepositional phrase sub-network23.5 A Sample ATN
Process scheduling21.2 Implementation
Process structure and instantiation21.1 The Process Abstraction
Prolog syntax equivalence24.3 Rules
Pruned Chocoblob search22.5 Cuts

Q
Query compiler19.5 A Query Compiler
Query interpreter19.3 A Query Interpreter
Quicksort24.7 Examples

R
Recursive expansion functions10.4 Recursion
Reference destructuring on sequences18.2 Other Structures
Removing methods25.2 Objects in Plain Lisp
Representation and definition of nodes6.1 Networks
Restrictions on continuation-passing macros20.2 Continuation-Passing Macros
Returning destructive equivalents5.2 Orthogonality

S
Sample network6.1 Networks
Scheme implementation of choose and fail22.3 Scheme Implementation
Search functions which compare elements4.4 Search
Sentence network23.5 A Sample ATN
Session of twenty questions6.1 Networks
Shifting and avoiding computation13.1 New Utilities
Shifting computation when finding averages13.1 New Utilities
Simple iteration macros11.3 Conditional Evaluation
Slow matching operator18.2 Other Structures
Small functions which operate on lists4.3 Operations on Lists
Some differences between Scheme and Common Lisp20.1 Scheme Continuations
Sub-network for strings of modifiers23.5 A Sample ATN
Synchronization with a blackboard21.2 Implementation
Syntax of queries19.2 Pattern-Matching Queries
Syntax of rules24.2 An Interpreter

T
The query compiler in use19.5 A Query Compiler
The query interpreter in use19.4 Restrictions on Binding
Three closures share a list2.6 Closures
Toplevel macro23.4 An ATN Compiler
Toplevel macro24.2 An Interpreter
Tree traversal using continuation-passing macros20.2 Continuation-Passing Macros
Tree traversal using continuations20.1 Scheme Continuations
Two expansions of the same query19.5 A Query Compiler
Two macros equivalent to and7.8 Macro Style
Two parsings for a sentence23.5 A Sample ATN
Two Trees20.1 Scheme Continuations
Two ways to fix the problem10.4 Recursion

U
Use of arguments known at compile-time13.1 New Utilities

Jump to:   A   B   C   D   E   F   G   I   L   M   N   O   P   Q   R   S   T   U  


[ << ] [ >> ]           [Top] [Contents] [Index] [Page Top / Bottom]