foo bar) ' ( f oo bar)) (match? (? ? foo bar) (foo bar)) (match? (? foo bar) (bar)) ( match? (foo bar) ()) 12 (match? (foo bar) (bar)) If #f match? (? foo bar) (foo bar)) ( match? (foo bar) (bar)) If (match? (foo bar) (foo bar)) | (match? (bar) (bar)) j | ( match ...
This lively introduction to computer science and computer programming in Scheme is for non-computer science majors with a strong interest in the subject and for computer science majors who lack prior programming experience. The text allows the student to experience the computer as a tool for expressing ideas, not as a frustrating set of mathematical obstacles. This goal is supported by the use of Scheme, a modern dialect of Lisp, designed to emphasize symbolic programming.