which cannot be prohibited statically
if we want both the language to be Turing complete,
and type inference to be decidable.