Worked on the report and split the coq program into 4 files (according to the report): 1 file containing tree def, 1 containing proof of strictly increasingness (right side of function composition), 1 containing proof of minimum with foldl1 (left side of function composition) and 1 linking them all together and proving build. Lots of work todo for Minimum, and some for SInc
Merge branch 'master' of https://github.com/ltbinsbe/INFODTP