GitLab

The underlying datastructure is not satisfying nor are the proofs but at
least there is a quick simple realization. It uses ClassicalEpsilon axioms
such as excluded middle, indefinite_description etc...
Some theory realizations are very far from reality because the axiom
characterization is small.

This patch also fully qualifies some realized types and constructors to
avoid inadvertent shadowing.

This removes lots of superfluous parentheses in the outer terms.

Coq printer.
Also adding the "pretty-printed" generated realization.



N604-045 Coq code easier to read

* src/printer/coq.ml
Added indentation in Why3's Coq printer using the OCaml Format pretty
printing module.
Changed the display of logic formulas and terms only.

(cherry picked from commit 3453a65e0e5fca7e3aa16e22915ee3f079daf1c6)

Conflicts:
	src/printer/coq.ml
	src/transform/gnat_split_conj.ml

(that is, using number of occurrences)
No more definition of permutation using inductive predicates.
Impacts array.ArrayPermut; proof sessions updated.
Coq realizations for map.Occ and map.MapPermut;
proof session for array.ArrayPermut in progress