Lecture 7, CSE341, Spring 2004 summary

* Finish course motivation

* BNF and summary of our recursively-defined ML constructs

* Functions taking functions
  * Absolutely nothing new here except you didn't think to do it
    * and some syntax for "anonymous" functions
  * Useful functions for combining functions
  * Useful functions for traversing recursive structures (e.g., map)

* connection with parametric polymorphism

* anonymous functions

* fun is just val, except for recursion

* Functions returning functions
  * Absolutely nothing new here except you didn't think to do it
  * Well, there is an interesting question about environment
     -- _the_ (?) hallmark of modern function languages