The LSV seminar takes place on Tuesday at 11:00 AM. The usual location is the conference room at Pavillon des Jardins (venue). If you wish to be informed by e-mail about upcoming seminars, please contact Stéphane Le Roux and Matthias Fuegger.
The seminar is open to public and does not require any form of registration.
A relational data type is a concrete data type that declares
invariants or relations that are verified by its constructors (see
[1]).
Moca [2] is a generic construction function generator for OCaml data
types. It allows the definition of complex invariants on data typs,
which are then automagically managed.
This talk will be divided into three parts:
- I will first introduce some theoretical background about relational
data types;
- then I will show how one can specify and use invariants with Moca;
- I will end the talk with a discussion about how one can apply such a
tool in the context of automated theorem proving. We will in
particular evoke the case of deduction modulo [3, 4] and the zenon automated
theorem prover [5, 6].
[1] On the implementation of constructor functions for non-free concrete
data types.
F. Blanqui, T. Hardin et P. Weis
[2] Moca
[3] Theorem proving modulo, revised version.
G. Dowek, Th. Hardin, and C. Kirchner
[4] TaMeD: a Tableaud Method for Deduction Modulo.
R. Bonichon
[5] Zenon : An Extensible Automated Theorem Prover Producing Checkable Proof.
R. Bonichon, D. Delahaye and D. Doligez
[6] Zenon