  We give a presentation of Krivine and Parigot's Second-order functional
arithmetic in Deduction modulo. Expressing this theory in Deduction modulo
sheds light on an original aspect of this theory: the fact that programs are
specified, not with propositions, but with congruences.
