Stéphane Lescuyer

Learn More
We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in solvable theory X. Our algorithm CC(X) is reminiscent of Shostak combination: it maintains a union-find data-structure modulo X from which maximal information about implied(More)
In an attempt to improve automation capabilities in the Coq proof assistant, we develop a tactic for the propositional fragment based on the DPLL procedure. Although formulas naturally arising in interactive proofs do not require a state-of-the-art SAT solver, the conversion to clausal form required by DPLL strongly damages the performance of the procedure.(More)
set of inference rules, in particular we do not specify how and when rules should be applied. This kind of presentation is more similar to Tinelli’s DPLL(T ) presentation [Tin02]. In our opinion, the main advantage of this approach is that we can manipulate the system without taking the details of a particular implementation into account. Typically, we can(More)
We present a Coq library for finite sets and maps which brings the same functionalities as the existing standard FSets/FMaps library, but ensures the genericity of the proposed data structures using type classes instead of modules. This architecture facilitates the use of these data structures thanks to overloading and implicit instantiation, and more(More)
This article introduces MLPOST, an OCaml library for scientific drawing. It is based on METAPOST, which allows inclusion of LTEX fragments. OCaml is an appealing alternative to LTEX macro languages, dedicated languages and even to graphic tools. In particular, MLPOST users benefit from OCaml’s expressiveness and static typing. Finally, MLPOST features a(More)
  • 1