Skip to Main content Skip to Navigation
New interface
Conference papers

PML 2 : Integrated Program Verification in ML

Rodolphe Lepigre 1 
1 DEDUCTEAM - Deduction modulo, interopérabilité et démonstration automatique
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
Abstract : We present the PML 2 language, which provides a uniform environment for programming, and for proving properties of programs in an ML-like setting. The language is Curry-style and call-by-value, it provides a control operator (interpreted in terms of classical logic), it supports general recursion and a very general form of (implicit, non-coercive) subtyping. In the system, equational properties of programs are expressed using two new type formers, and they are proved by constructing terminating programs. Although proofs rely heavily on equational reasoning, equalities are exclusively managed by the type-checker. This means that the user only has to choose which equality to use, and not where to use it, as is usually done in mathematical proofs. In the system, writing proofs mostly amounts to applying lemmas (possibly recursive function calls), and to perform case analyses (pattern matchings).
Complete list of metadata
Contributor : Rodolphe Lepigre Connect in order to contact the contributor
Submitted on : Monday, January 7, 2019 - 2:27:48 PM
Last modification on : Friday, February 4, 2022 - 3:21:35 AM
Long-term archiving on: : Monday, April 8, 2019 - 5:06:23 PM


lepigre_types2017 (1).pdf
Files produced by the author(s)



Rodolphe Lepigre. PML 2 : Integrated Program Verification in ML. 23rd International Conference on Types for Proofs and Programs (TYPES 2017), Jul 2017, Budapest, Hungary. pp.27, ⟨10.4230/LIPIcs.TYPES.2017.5⟩. ⟨hal-01972000⟩



Record views


Files downloads