Assignment, State, Environments I

1. Functional Programming I
2. Functional Programming II
3. Functions of Functions
4. Higher-Order Procedures
5. Recursion and Iteration II
6. UI Recursion and Iteration III
7. Data Abstraction, Sequences Calculator I
8. Data Abstraction, Sequences Calculator II
9. Data Abstraction, Sequences Calculator III
10. Hierarchical Data
11. Hierarchical Data II
12. Interpreter
13. Generic Operators I
14. Generic Operators II
15. Object-Oriented Programming I
16. Object-Oriented Programming II
17. Object-Oriented Programming III
18. Assignment, State, Environments I
19. Assignment, State, Environments II
20. Assignment, State, Environments III
21. Mutable Data
22. Vectors I
23. Vectors II
24. Client Server
25. Concurrency I
26. Concurrency II
27. Streams
28. Shell Programming I
29. Shell Programming II
30. Metacircular Evaluation I
31. Metacircular Evaluation II
32. Mapreduce I
33. Mapreduce II
34. Therac
35. Lazy Evaluation I
36. Nondeterministic Evaluation
37. Logic Programming I
38. Logic Programming II
39. Review I
40. Review II

Introduction to programming and computer science., by Prof. Brian Harvey This course exposes students to techniques of abstraction at several levels: (a) within a programming language, using higher-order functions, manifest types, data-directed programming, and message-passing; (b) between programming languages, using functional and rule-based languages as examples. It also relates these techniques to the practical problems of implementation of languages and algorithms on a von Neumann machine. There are several significant programming projects, programmed in a dialect of the LISP language.