![[PLT logo]](/CS/PLT/Teaching/Workshops/2000/ts2k-small.gif)
TeachScheme! 2000
July 10-14, 2000 |
Workshop Program |
|
|
| Morning | Afternoon | Night | ||||||
|---|---|---|---|---|---|---|---|---|
| Monday: |
Welcome to TeachScheme! What's Computer Science about? Programming and computing Expressions, Functions & Creative Algebra The Design Recipe The Guideline
|
Conditionals Designing Conditional Programs Compound Data 1: Using posn Structures Designing Structural Programs
|
||||||
| Tuesday: |
Compound Data: Define Your Own Structures Mixed Data: Mixing several structures
|
Compound Data 2: Lists Data of Arbitrary Size: Lists Design Recipe for Recursion
|
||||||
| Wednesday: |
Producing Lists Structures in Lists
|
More Data of Arbitrary Size: - Structures in Structures - Lists in Lists
|
|
|||||
| Thursday: |
Mutually-referential Data Definitions [show only] Note: Generalizing the Design Recipe Iterative Refinement: File Systems [show only]
|
Classroom Experience with TeachScheme! Introduction to Scheme evaluation
|
|
|||||
| Friday: |
Evaluating Scheme
|
Perspective & Outlook Generative Recursion Functional Abstraction
|
![[Point]](/CS/Images/hand.right.gif)