Thu, 29 Nov 2007 07:55:46 +0100 dropped dead code
haftmann [Thu, 29 Nov 2007 07:55:46 +0100] rev 25501
dropped dead code
Wed, 28 Nov 2007 19:54:50 +0100 polyml: default heap size is back to -H 200 (people are still using
wenzelm [Wed, 28 Nov 2007 19:54:50 +0100] rev 25500
polyml: default heap size is back to -H 200 (people are still using machines with < 1GB of memory; no need to workaround heap problems of polyml-5.0 anymore);
Wed, 28 Nov 2007 18:39:53 +0100 an example file for how to treat Felleisen-Hieb-style contexts
urbanc [Wed, 28 Nov 2007 18:39:53 +0100] rev 25499
an example file for how to treat Felleisen-Hieb-style contexts in nominal
Wed, 28 Nov 2007 16:46:45 +0100 removed (cf. object_logic.ML);
wenzelm [Wed, 28 Nov 2007 16:46:45 +0100] rev 25498
removed (cf. object_logic.ML);
Wed, 28 Nov 2007 16:44:24 +0100 added base_sort;
wenzelm [Wed, 28 Nov 2007 16:44:24 +0100] rev 25497
added base_sort; added typedecl, dependent on base_sort (cf. intermediate typedecl.ML and former sign.ML, HOL/Tools/typedef_package.ML); typedecl: recovered proper use of Syntax.type_name;
Wed, 28 Nov 2007 16:44:22 +0100 removed typedecl.ML (cf. object_logic.ML);
wenzelm [Wed, 28 Nov 2007 16:44:22 +0100] rev 25496
removed typedecl.ML (cf. object_logic.ML);
Wed, 28 Nov 2007 16:44:20 +0100 ObjectLogic.typedecl;
wenzelm [Wed, 28 Nov 2007 16:44:20 +0100] rev 25495
ObjectLogic.typedecl;
Wed, 28 Nov 2007 16:44:18 +0100 replaced typedecl interpretation by ObjectLogic.typedecl (based on base_sort);
wenzelm [Wed, 28 Nov 2007 16:44:18 +0100] rev 25494
replaced typedecl interpretation by ObjectLogic.typedecl (based on base_sort);
Wed, 28 Nov 2007 16:26:53 +0100 simplified using sledgehammer
paulson [Wed, 28 Nov 2007 16:26:53 +0100] rev 25493
simplified using sledgehammer
Wed, 28 Nov 2007 16:26:03 +0100 Chained theorems are no longer mentioned in metis calls and (if used) they prevent the
paulson [Wed, 28 Nov 2007 16:26:03 +0100] rev 25492
Chained theorems are no longer mentioned in metis calls and (if used) they prevent the output of a structured proof.
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip