When using the Curry-Howard correspondence in order to obtain executable programs from mathematical proofs, we are faced with a difficult problem : to interpret each axiom of our axiom system for mathematics (which may be, for example, second order classical logic, or classical set theory) as an instruction of our programming language. This problem has been solved for the axiom of excluded midd...