Sketchy LISP

An Introduction to Functional Programming in Scheme

Contents

(collapsed)

Preface

1 Basic Scheme Programming

1.1 Notation

1.2 Functional Programming

1.3 Loops in Functional Programs

1.4 Basic Data Types

1.5 Some Things You can do with Lists

1.6 Procedures and Local Scopes

1.7 Different Ways of Binding Symbols

1.8 Lists, Pairs, and History

2 Less Basic Scheme Programming

2.1 Variable Argument Procedures

2.2 Identity and Equality

2.3 Higher Order Functions

2.4 Dynamic Typing

2.5 Type Conversion

2.6 Arithmetics

2.7 Strings and Characters Recycled

2.8 Input, Output, and Side Effects

3 Some Missing Pieces

3.1 Syntax Transformation

3.2 Quasiquotation

3.3 Tail-recursive Programs

3.4 Continuations

3.5 Lambda Calculus and the Y Combinator

4 Scheme in the Wild

4.1 Drawing Box Diagrams

4.2 The DRAW-TREE Program

The End

Appendix

A.1 First Steps in Scheme

A.2 Scheme Style Guide

A.3 Table of Example Programs

A.4 Scheme Syntax and Procedures

Index