Mon, 27 Jun 2011 17:51:28 +0200 proper checking of @{ML_antiquotation};
wenzelm [Mon, 27 Jun 2011 17:51:28 +0200] rev 43563
proper checking of @{ML_antiquotation};
Mon, 27 Jun 2011 17:20:24 +0200 hide rather short auxiliary names, which can easily occur in user theories;
wenzelm [Mon, 27 Jun 2011 17:20:24 +0200] rev 43562
hide rather short auxiliary names, which can easily occur in user theories;
Mon, 27 Jun 2011 17:06:06 +0200 updated generated file;
wenzelm [Mon, 27 Jun 2011 17:06:06 +0200] rev 43561
updated generated file;
Mon, 27 Jun 2011 16:53:31 +0200 ML antiquotations are managed as theory data, with proper name space and entity markup;
wenzelm [Mon, 27 Jun 2011 16:53:31 +0200] rev 43560
ML antiquotations are managed as theory data, with proper name space and entity markup; clarified Name_Space.check;
Mon, 27 Jun 2011 15:03:55 +0200 old gensym is now legacy -- global state is out of fashion, and its result is not guaranteed to be fresh;
wenzelm [Mon, 27 Jun 2011 15:03:55 +0200] rev 43559
old gensym is now legacy -- global state is out of fashion, and its result is not guaranteed to be fresh;
Mon, 27 Jun 2011 15:01:08 +0200 parallel Syntax.parse, which is rather slow;
wenzelm [Mon, 27 Jun 2011 15:01:08 +0200] rev 43558
parallel Syntax.parse, which is rather slow;
Mon, 27 Jun 2011 14:38:58 +0200 markup binding like class, which is the only special markup where Proof General (including version 4.1) allows "isar-long-id-stuff";
wenzelm [Mon, 27 Jun 2011 14:38:58 +0200] rev 43557
markup binding like class, which is the only special markup where Proof General (including version 4.1) allows "isar-long-id-stuff";
Mon, 27 Jun 2011 09:42:46 +0200 move conditional expectation to its own theory file
hoelzl [Mon, 27 Jun 2011 09:42:46 +0200] rev 43556
move conditional expectation to its own theory file
Sun, 26 Jun 2011 19:10:03 +0200 updated SMT certificates
boehmes [Sun, 26 Jun 2011 19:10:03 +0200] rev 43555
updated SMT certificates
Sun, 26 Jun 2011 19:10:02 +0200 generalized introduction of explicit application constant: consider more functions as possible witness/instance of quantifiers than before (a constant of type T1 -> T2 -> T3 should be considered to have a rank less or equal to 1 if variables of type T2 -> T3 occur bound in a problem);
boehmes [Sun, 26 Jun 2011 19:10:02 +0200] rev 43554
generalized introduction of explicit application constant: consider more functions as possible witness/instance of quantifiers than before (a constant of type T1 -> T2 -> T3 should be considered to have a rank less or equal to 1 if variables of type T2 -> T3 occur bound in a problem); maintain extra-logical information when introducing explicit application; handle let-expressions properly
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip