Sound & (in-)complete proof system for first-order logics
Some clarification (I hope)
I am working as professor in computer science in the group Reliable Systems at the Department of Computer Science, Faculty of Mathematics and Natural Science, University in Oslo.
Some clarification (I hope)
Formal methods as sales pitch
or maybe also not the first time.
like for instance for the functional programming course.
(White-)space exploration, FORTRAN, lexing, antiquity & fetishism
or why Y?
A lesser known fact on Ackermann’s function, and the power of higher-order functions
and functions too
Some fineprint on substitution
A small amount of background information (best read in the context of the first sets)
Recursion on the tail or otherwise
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
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?