Symbolic Computation

Table of Contents

Symbolic Computation

Symbols & Quotation

Lists & Evaluation

Scheme Procedures

Lambda Conversion

The Importance of Lists

Other List Functions

Function Composition

Basic Predicates - NULL?

Basic Predicates - EQ?

Other Equality Tests

The Conditional: COND

A Simple Conditional: IF

Tail (or Flat) Recursion - APPEND

More Tail Recursion - REMOVE

Inefficiencies - Naive Reverse

Accumulators - Better REVERSE

Lists & Trees

Depth-First Tree Search

Breadth-First Tree Search

Another Tree Recursion Example

Final Tree Example - Flatten

Procedures As Arguments

Iteration with Mapping Functions

Procedures As Values

Lexical Scoping

Binding Environments (I)

Binding Environments (II)

Why We Need LETREC

Procedural Abstraction

Using Procedural Abstraction

Abstraction of Depth-First Search

Abstraction of Breadth-First Search

Better Function Using LETREC

Managing Local State

Creating objects & sending messages

Email: [email protected]

Home Page: http://members.aol.com/JacksonPE/music1/home.htm

Other information:
These are my Scheme programming slides from when I used to teach a course in Symbolic Computation.

Download presentation source