Some work on proving Var case in inferencer completeness
Proved Var (Short x) case with extra side condition on local lets
Merge remote-tracking branch 'origin/master' into inferencer_completeness
Working on App for inference
Some work on constrain_op_complete
Add theorems to unifyScript
Define t_compat and prove the corresponding lemmas + outline proof of 2 constrain_op cases
Proved completeness for constrain_op
Moved some thms around, proved Raise and fix part of Let
Define and halfway through proving infer_p_complete, did more cases of infer_e
Proved infer_p complete, partially proved infer_pes
Rewrite the theorem statement for infer_pes_complete and try to use it in Handle/Match cases
Proved most of infer_pes_complete
Fixed infer_pes thm statement and proved the cheat, prove Handle as well
Proved Match case with (probably) over-complicated proof
Roughly looked through the rest of the cases, Letrec should be the only hard one left
Pull out common thm about list extension
Some small progress on Letrec
Proved Letrec without cheats
Finish proof ofinfer_e completeness