Participant : Yann Régis-Gianas.
In collaboration with Johannes Kanig (PhD student, LRI/INRIA Proval/UPS), Yann Régis-Gianas has started the development of a new implementation of Pangolin, a call-by-value functional language that embeds a proof system, as described in his thesis. Indeed, a prototype implementation has already been released during Yann Régis-Gianas' PhD thesis. Yet, this prototype had some bugs, some intrinsic scalability problems and its underlying programming language was minimalistic.
To ensure correctness, the kernel of the new implementation will be extracted from a Coq development (which is a part of the metatheory proof mentioned above). A Coq-based validation process of program proofs will also be based on this Coq development.
To solve the scalability problems, the programming interface will be based on semantic patches, which should enable the reusability of proofs through evolutions of programs. The Pangolin prover should also improve the number of automatically discharged proofs.
To make the language as realistic as possible, standard programming mechanisms like exceptions, type coercion and type classes will be integrated in this new implementation.