A lesser known fact on Ackermann’s function
I am working as professor in computer science in the group Reliable Systems (formerly called PMA) at the Department of Computer Science, Faculty of Mathematics and Natural Science, University in Oslo.
like for instance the compiler construction course.
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
Some clarification (I hope)
Formal methods as sales pitch
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