PML (Proved ML)

Christophe Raffalli (1) , Pierre Hyvernat (1)

1 LAMA - Laboratoire de Mathématiques

PML is a variant of the ML language (like SML or OCaml) which focuses both on being able to prove programs and be really usable. The current version starts to fulfill both goals even if several major features are still under development (like a compiler or basic data types like char or machine integers). PML should also be usable to develop certified mathematics. Current status: the core language has now stabilized and one can start writing proofs. Many examples are available in the examples and lib folders. PML is not yet usable as a production programming language. It is still a research platform. Nevertheless, I will be grateful if you try it and report about your experience and problems.

Mots clés: Programming language; ML; types; formal methods

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

Christophe Raffalli, Pierre Hyvernat. PML (Proved ML). 2008. ⟨hal-00394685⟩