Teacher: Sebastian Mödersheim.
Textbook: Functional Programming using F#, Michael R. Hansen and Hans Rischel, Cambridge University Press, 2013. (Abbreviated HR.)
| Week | Date | Topic | Read | Exercises |
|---|---|---|---|---|
| 36 | 5. Sept. |
Course introduction Intro. to functional programming and F# Lists (brief introduction) | HR 1, HR 2.1-2.6, HR 4.1-4.3 |
Installation of F# and first programs See Material folder on DTU Learn |
| 37 | 12. Sept. | Functions, Basic types, Tuples and Lists |
HR 2, HR 3.1-3.3, 3.5, 3.6 HR 4.1 - 4.4 |
|
| 38 | 19. Sept. | Structuring and Testing | HR 3.4-3.7, HR 4 | |
| 39 | 26. Sept. |
Algebraic Data Types
Higher-order list functions |
HR 3.8-3.11, HR 5.1 | |
| 40 | 3. Oct. | Lambda Calculus and all that |
|
|
| 41 | 10. Oct. |
Collections: Sets and Maps
|
HR 5.2-5.3 |
|
| 42 | Autumn vacation | |||
| 43 | 24. Oct. |
Modules Type inference |
HR 7 |
|
| 44 | 31. Oct. | Finite trees (I) | HR 6 |
|
| 45 | 7. Nov. |
Finite trees (II) |
HR 6 |
|
| 46 | 14. Nov. | Tail recursion | HR 9 |
|
| 47 | 21. Nov. |
Sequences |
HR 11 | |
| 48 | 28. Nov. |
Verification |
||
| 49 | 5. Dec. | Lab day - reviewing old exams and soltions |