Worklist algorithms
A small amount of background information (best read in the context of the first sets)
A small amount of background information (best read in the context of the first sets)
or maybe also not the first time.
Recursion on the tail or otherwise
(White-)space exploration, FORTRAN, lexing, antiquity & fetishism
like for instance the compiler construction course.
Or the weak, the loose, and the unsafe. But does it mean anything?
Or maybe how not to implement it?
like for instance for the functional programming course.
Representation of expressions in the meta-circular evaluator
A glance at Church numerals, inductive data types, and pattern matching
or why Y?
and functions too
A lesser known fact on Ackermann’s function, and the power of higher-order functions
Formal methods as sales pitch