CS 451 Programming Paradigms
Week Three
Lecture 5 : Tuesday, 2/1/00
- Reviewed the use of a recursive environment to generate graph search
- Described difference between depth-, breadth-, and best-first search
- Introduced LISP constructs to generate graph search
- Presented LISP algorithms for depth-, breadth-, and best-first searches
- Discussed the second assignment, now available on the main course web page
- Finished LISP Basics tutorial.
Lecture 6 : Thursday, 2/3/00
- Discussed higher-order functions like map and filter. See LISP Higher Order Function Tutorial.
- Discussed use of funcall, apply, and eval
- Presented lambda expressions and closures
- Discussed how to create instances of objects using lambdas and closures
- Began discussion of meta-interpreter for interacting with these objects
- Discussed delegation as a model for inheritance, which we will return to in Lecture 7. See Object-Oriented Lambda Example.
[ Back to CS451: Lecture Summaries ]