Jean-Christophe Filliatre

Proof of Imperative Programs in Type Theory. (1997)

Filliatre, Jean-Christophe

(eng) Proofs of correctness of imperative programs are traditionally done in first order frameworks derived from Hoare logic~\cite{Hoare69}. On the other hand, correctness proofs of purely functional...

Proof of Imperative Programs in Type Theory (1997)

Ecole Normale, Suprieure Lyon, Jean-Christophe Filliâtre, Jean-christophe Filliatre

Proofs of correctness of imperative programs are traditionally done in first order frameworks derived from Hoare logic [8]. On the other hand, correctness proofs of purely functional programs are...

A decision procedure for Direct Predicate Calculus. Study and implementation in the system Coq. (1995)

Filliatre, Jean-Christophe

(eng) The paper of J. Ketonen and R. Weyhrauch [6] defines a decidable fragment of first-order predicate logic - Direct Predicate Calculus - as the subset which is provable in Gentzen sequent...