Fixed the "unexpected" continuations example and the threads examples.
Version 2.07, 2014-02-09
Added some explicit general advice and strategies to techniques for function aprogramming section.
Added example of default arguments to eliminate helper function in accumulator and continuation passing versions of tail-recursion examples.
Version 2.06, 2014-01-27
Added mutable state, tail recursion, and continuations sections.
Version 2.05, 2014-01-21
Improved fuctional truth operators land, lor, and added the generalized 0 or more argument versions.
Version 2.04, 2014-01-19
Added prefix-list computation that uses foldl
Added lambda implementations of TRUE and FALSE.
Version 2.03, 2014-01-13
Fixed typographical errors in sample code.
Added another variation on the prefix computation.
Version 2.02, 2014-01-13
Cleaned up and expanded techniques for functional programming section.
Cleaned up section on special forms and definition
Version 2.01, 2014-01-06
Cleaned up example of fcompose so that it uses the first, second, and list operators. Also expanded explanation of loop state transition function
Converted all refernces to scheme .ss files to racket .rkt files.
Version 2.00, 2014-01-01
Began brand new release, conversion to lang racket for Scheme code examples.
Version 1.25, November 30, 2010
Added calculator example from class to parsing section.
Version 1.24, November 17, 2010
Added new section on types in Haskell
Version 1.23, November 16, 2010
Fixed bracketing error in fib that caused infinite recursion!
Added shuffle example from class
Version 1.22, November 15, 2010
Added Haskell introduction chapter.
Version 1.21, November 2, 2010
Expanded the Streams example with more comments, and replaced s-car and s-cdr with s-first and s-rest which are more reasonable names since streams are like infinite lists.
Version 1.20, November 2, 2010
Fixed bug in Queue.ss
Added promise example
Version 1.19, October 25, 2010
Minor edits to coroutine example in section on continuations
Version 1.18, October 22, 2010
Minor grammar fixes.
Completely revised section on continuations.
Version 1.16, September 20, 2010Version 1.17, October 05, 2010
Cleaned up examples in code transformation section.
Version 1.16, September 20, 2010
added discussion on evaluation strategies.
corrected errors in special forms examples
clarified part of Y-combinator discussion.
Version 1.15, September 16, 2010
Fixed various typos in restricted scheme desvription.
Version 1.14, September 14, 2010
Fixed various typos in early sections. Added reduction to lambda calculus summary.
Version 1.13, November 27, 2009
Continued with parsing example, and added example of type classes to the postfix calculator.
Version 1.12, November 19, 2009
Added examples of parsing in Haskell
Version 1.11, October 28, 2009
Examples of streams based on SICP Chapter 3.
Version 1.10, October 27, 2009
Examples of the threads problem
Mutable data structures
Version 1.09, October 25, 2009
More on continuations
Version 1.08, October 21, 2009
Stateful computation
Continuations, in both Scheme and Perl
Version 1.07, October 1, 2009
How to thread state while walking over a the list representation of a Scheme program
Illustrative evaluator for expressions.
Version 1.06, September 29, 2009
How to walk over a the list representation of a Scheme program
Version 1.04, September 24, 2009Version 1.05, September 24, 2009
Added typical recursive defintions
Added mutually recursive definitions
Version 1.04, September 24, 2009
More Techniques for functional programming (Prefix.ss)
Special Forms and Lazyness
Y-combinator
Version 1.03, September 15, 2009
Techniques for functional programming.
Version 1.02, September 12, 2009
Added more examples to the restructed Scheme example file.
Version 1.01, September 10, 2009
Added section on function composition example from class.
Version 1.00, September 10, 2009
Slight revision to overview section.
Added intro to extended untyped lambda calculus subset of Scheme.
