Functional Programming in Scheme
Lecture Descriptions


Lecture numberSubjectDescription
1
Monday January 3, 2000
Introduction to functional programmingIn this lecture we introduce functional programming, especially as a contrast to plain imperative programming
2
Friday February 4, 2000
The function conceptThe concept of functions is central. Here we take a close look at this
3
Friday February 11, 2000
The list conceptLists are classical data structures in functional programming. Here we introduce the original Lisp list concept
4
Friday February 18, 2000
Higher order functionsHigher order functions accept functions are parameters, and they allow us to return a function as the result
5
Friday February 25, 2000
Evaluation orderEvaluation order is one of the more advanced aspects in this course


Kurt Nørmark

Generated: Wednesday August 27, 2003, 22:51:06

The LAML home page
The Scheme Repository
Kurt Nørmark