How to prepare for an oral exam?
like for instance for the functional programming course.
The page collects posts in connection with the lecture ``Functional Programming’’ (IN2040) I am planning for information of about the material and content of the lecture, mostly of tangential interest. Important organizational messages will not appear here, but as “beskjeder” on the official IFI page (and email) and the other more official communication channels.
In particular, the blog-posts here are NOT pensum. The intention is to shed additional light on the material covered in the lecture, sometimes only loosely connected, with the hope of being useful or entertaining. The lecture is in Norwegian, but at this place, I will post in English.
Contact
Programming
| R5RS and DrRacket |
| DrRacket documentation |
Textbook
| SICP |
| newer version (ebooks) |
Short cuts
| vortex webpage 2022 | semester page | |
| oblig directory | obliger | |
| exercises directory | ||
| pensum | detailed pensum list | |
| discussion forum 2022 | https://github.uio.no/IN2040/h22 | |
| group teachers page | ||
| vakker scheme | ||
| emacs & scheme | ||
| some discussion platform | mattermost | |
| git pages | https://github.uio.no/IN2040/IN2040.pages.github.uio.no | non-public |
| 2040 organization | https://github.uio.no/IN2040/ | non-public |
| lecture 2022 | https://github.uio.no/IN2040/2022 | non-public |
Posts
(Not so) abstract syntax trees
Representation of expressions in the meta-circular evaluator
Y not code up $n!$ with no recursion and no Y tricks either?
A glance at Church numerals, inductive data types, and pattern matching
Y Y?
or why Y?
Processes and procedures
and functions too
Recursion, primitive or otherwise
A lesser known fact on Ackermann’s function, and the power of higher-order functions