We present a toy functional programming language inspired by our work on the PML language [22] together with a criterion ensuring safety and the fact that non termination can only occur via recursive programs. To prove this theorem, we use realizability techniques and a semantical notion of types. Important features of PML like polymorphism, proof-checking, termination criterion for recursive f...
