Selected publications at LSV

We present the PML2 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).

   address = {Budapest, Hungary},
   author = {Rodolphe Lepigre},
   booktitle = {{P}roceedings of the 23rd {I}nternational {C}onference on {T}ypes for {P}roofs and {P}rograms ({TYPES}'17},
   editor = {Ambrus Kaposi and Tam{\'a}s Kozsik},
   note = {To appear},
   publisher = {Leibniz-Zentrum f{\"u}r Informatik},
   series = {Leibniz International Proceedings in Informatics},
   title = {{PML\(_2\):} Integrated Program Verification in ML},
   year = {2018},

About LSV

Select by Year