How to write a parser for the first time, e.g. for the oblig
or maybe also not the first time.
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.
2025
How to prepare for an oral exam?
like for instance for the functional programming course.
Did Fortran kill a Mars Mission?
(White-)space exploration, FORTRAN, lexing, antiquity & fetishism
2024
Y Y?
or why Y?
Recursion, primitive or otherwise
A lesser known fact on Ackermann’s function, and the power of higher-order functions
Processes and procedures
and functions too
What’s in a name?
Some fineprint on substitution
Worklist algorithms
A small amount of background information (best read in the context of the first sets)
Regular expressions, context-free grammars, and recursion
Recursion on the tail or otherwise
How to prepare for an oral exam?
like for instance for the functional programming course.
2023
(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
How to prepare for an oral exam
like for instance the compiler construction course.
Type systems: the strong, the strict and the safe.
Or the weak, the loose, and the unsafe. But does it mean anything?
How to implement regular expression matching
Or maybe how not to implement it?
2022
Back to top ↑2021
Fol Soundandcomplete
w— title: “Sound & (in-)complete proof system for first-order logics” excerpt: “Some clarification (I hope)” last_modified_at: <2021-07-15 Thu> hea...
Bitcoin, blockchain & formal methods, seriously now?
Formal methods as sales pitch