Type systems: the strong, the strict and the safe.
Or the weak, the loose, and the unsafe. But does it mean anything?
Or the weak, the loose, and the unsafe. But does it mean anything?
A small amount of background information (best read in the context of the first sets)
or maybe also not the first time.
Or maybe how not to implement it?
(White-)space exploration, FORTRAN, lexing, antiquity & fetischism
like for instance the compiler construction course.
A glance at Church numerals, inductive data types, and pattern matching
or why Y?
A lesser known fact on Ackermann’s function
In the lecture, we covered type inference for generic polymorphism in a typed calculus with higher-order functions, including recursive functions and let-bin...
Some remarks about variations on the theme
Some clarification (I hope)
Formal methods as sales pitch