Type systems: the strong, the strict and the safe.

Or the weak, the loose, and the unsafe. But does it mean anything?

Worklist algorithms

A small amount of background information (best read in the context of the first sets)

How to write a parser for the first time, e.g. for the oblig

or maybe also not the first time.

How to implement regular expression matching

Or maybe how not to implement it?

Did Fortran kill a Mars Mission?

(White-)space exploration, FORTRAN, lexing, antiquity & fetischism

How to prepare for an oral exam

like for instance the compiler construction course.

Y not code up $n!$ with no recursion and no Y tricks either?

A glance at Church numerals, inductive data types, and pattern matching

or why Y?

Recursion, primitive or otherwise

A lesser known fact on Ackermann’s function

Mono- vs. polymorphic let

In the lecture, we covered type inference for generic polymorphism in a typed calculus with higher-order functions, including recursive functions and let-bin...

Type inference (Algos W and J …)

Some remarks about variations on the theme

Sound & (in-)complete proof system for first-order logics

Some clarification (I hope)