Realizability for programming languages.

Christophe Raffalli (1)

1 LAMA - Laboratoire de Mathématiques

We present a toy functional programming language inspired by our work on PML 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.

Mots clés: realizability; typing; functional; programming; language

Domaines: Logique en informatique [cs.LO]; Langage de programmation [cs.PL]

Christophe Raffalli. Realizability for programming languages.. 2010. ⟨hal-00474043⟩