Mon, 11 Apr 2011 17:11:03 +0200 Name_Space.entry_markup: keep def position as separate properties;
wenzelm [Mon, 11 Apr 2011 17:11:03 +0200] rev 42327
Name_Space.entry_markup: keep def position as separate properties; uniform treatment of ML_def/ML_open/ML_struct as entities; hyperlinks for all entities -- excluding ML_open/ML_struct for now;
Sat, 09 Apr 2011 23:29:50 +0200 some position reports for 'translations';
wenzelm [Sat, 09 Apr 2011 23:29:50 +0200] rev 42326
some position reports for 'translations';
Sat, 09 Apr 2011 15:00:23 +0200 made SML/NJ happy;
wenzelm [Sat, 09 Apr 2011 15:00:23 +0200] rev 42325
made SML/NJ happy;
Sat, 09 Apr 2011 13:10:20 +0200 merged
wenzelm [Sat, 09 Apr 2011 13:10:20 +0200] rev 42324
merged
Fri, 08 Apr 2011 19:04:08 +0200 added SMT certificates
boehmes [Fri, 08 Apr 2011 19:04:08 +0200] rev 42323
added SMT certificates
Fri, 08 Apr 2011 19:04:08 +0200 use unification instead of matching to find proper assertions (which might not match original assumptions due to lambda-lifting and introduction of fresh variables)
boehmes [Fri, 08 Apr 2011 19:04:08 +0200] rev 42322
use unification instead of matching to find proper assertions (which might not match original assumptions due to lambda-lifting and introduction of fresh variables)
Fri, 08 Apr 2011 19:04:08 +0200 fixed eta-expansion: use correct order to apply new bound variables
boehmes [Fri, 08 Apr 2011 19:04:08 +0200] rev 42321
fixed eta-expansion: use correct order to apply new bound variables
Fri, 08 Apr 2011 19:04:08 +0200 check if negating the goal is possible (avoids CTERM exception for Pure propositions)
boehmes [Fri, 08 Apr 2011 19:04:08 +0200] rev 42320
check if negating the goal is possible (avoids CTERM exception for Pure propositions)
Fri, 08 Apr 2011 19:04:08 +0200 unfold and eta-contract let expressions before lambda-lifting to avoid bad terms
boehmes [Fri, 08 Apr 2011 19:04:08 +0200] rev 42319
unfold and eta-contract let expressions before lambda-lifting to avoid bad terms
Fri, 08 Apr 2011 19:04:08 +0200 corrected order of steps in Z3 proof reconstruction for elimination of unused quantified variables: first try to eliminate unused variables, then skip over used variables
boehmes [Fri, 08 Apr 2011 19:04:08 +0200] rev 42318
corrected order of steps in Z3 proof reconstruction for elimination of unused quantified variables: first try to eliminate unused variables, then skip over used variables
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip