Com S 342: Principles of Programming Languages

Got a question?

Got a question or comment? Contact us at (515) 294-6168 or hridesh@cs.iastate.edu.

Course Library Code Examples

This page gives access to code examples in the course library.

You can use the table of contents (on the web) to jump directly to the kind of example you are looking for.

If you click on a Scheme file name and your browser tries to download a plugin (e.g., for a Lotus Screen Cam Movie), then you need to change your browser's rules for associating file suffixes with viewers. One way to do this on Windows is to go into the Windows Explorer, and click on "View" then "Folder Options", then click on the "File Types" tab, and then enter a new file type for .scm files.

Contents

1. Little Schemer, Chapter 2
2. Little Schemer, Chapter 3
3. Little Schemer, Chapter 4

The Little Schemer, Chapter 2

Recursion over flat lists, without conditionals

• list-cp-mod.scm, list-cp is a prototype for these kinds of procedures, although it doesn't seem to do much.
• list-ln-mod.scm: Recursively computes the length of a list.
• increment-each-mod.scm: Recursively increments each item in a list by one. Provides function (increment-each).
• make-each-absolute-mod.scm: Convert each item in the list to its absolute value. Provides function (make-each-absolute).
• mapcdr-mod.scm (mapcdr)
• list-map-mod.scm (list-map)

The Little Schemer, Chapter 3

Recursion over flat lists, with conditionals

• delete-even-mod.scm (delete-even)

The Little Schemer, Chapter 4

Recursion over the natural numbers

• nat-leq-mod.scm (nat-leq)
• nth-element-mod.scm (nth-element)
• unary-notation-mod.scm (unary-notation)
• expt-maker-mod.scm (expt-maker)