Sat, 01 Apr 2000 20:09:52 +0200 added ProofGeneral.undo;
wenzelm [Sat, 01 Apr 2000 20:09:52 +0200] rev 8647
added ProofGeneral.undo;
Sat, 01 Apr 2000 20:09:20 +0200 isatool document: check output file (workaround PolyML problem with RC);
wenzelm [Sat, 01 Apr 2000 20:09:20 +0200] rev 8646
isatool document: check output file (workaround PolyML problem with RC);
Fri, 31 Mar 2000 22:39:39 +0200 use cong_add_global att;
wenzelm [Fri, 31 Mar 2000 22:39:39 +0200] rev 8645
use cong_add_global att;
Fri, 31 Mar 2000 22:39:06 +0200 added cong atts;
wenzelm [Fri, 31 Mar 2000 22:39:06 +0200] rev 8644
added cong atts;
Fri, 31 Mar 2000 22:22:23 +0200 added cong atts;
wenzelm [Fri, 31 Mar 2000 22:22:23 +0200] rev 8643
added cong atts;
Fri, 31 Mar 2000 22:01:01 +0200 made SML/XL happy;
wenzelm [Fri, 31 Mar 2000 22:01:01 +0200] rev 8642
made SML/XL happy;
Fri, 31 Mar 2000 22:00:36 +0200 change_global/local_css move to Provers/clasimp.ML;
wenzelm [Fri, 31 Mar 2000 22:00:36 +0200] rev 8641
change_global/local_css move to Provers/clasimp.ML; fixed 'iff' att syntax; added 'cong' att;
Fri, 31 Mar 2000 21:59:37 +0200 setup cong_attrib_setup;
wenzelm [Fri, 31 Mar 2000 21:59:37 +0200] rev 8640
setup cong_attrib_setup;
Fri, 31 Mar 2000 21:58:34 +0200 added change_global/local_css;
wenzelm [Fri, 31 Mar 2000 21:58:34 +0200] rev 8639
added change_global/local_css;
Fri, 31 Mar 2000 21:57:14 +0200 added 'cong' att;
wenzelm [Fri, 31 Mar 2000 21:57:14 +0200] rev 8638
added 'cong' att; fixed 'iff' syntax;
Fri, 31 Mar 2000 21:56:23 +0200 tuned;
wenzelm [Fri, 31 Mar 2000 21:56:23 +0200] rev 8637
tuned;
Fri, 31 Mar 2000 21:56:13 +0200 params: preserve case names;
wenzelm [Fri, 31 Mar 2000 21:56:13 +0200] rev 8636
params: preserve case names;
Fri, 31 Mar 2000 21:55:51 +0200 fixed indexing of elim rules;
wenzelm [Fri, 31 Mar 2000 21:55:51 +0200] rev 8635
fixed indexing of elim rules;
Fri, 31 Mar 2000 21:55:27 +0200 use Attrib.add_del_args;
wenzelm [Fri, 31 Mar 2000 21:55:27 +0200] rev 8634
use Attrib.add_del_args;
Fri, 31 Mar 2000 21:54:50 +0200 added add_del_args;
wenzelm [Fri, 31 Mar 2000 21:54:50 +0200] rev 8633
added add_del_args;
Fri, 31 Mar 2000 18:10:21 +0200 fixed goal syntax;
wenzelm [Fri, 31 Mar 2000 18:10:21 +0200] rev 8632
fixed goal syntax;
Fri, 31 Mar 2000 10:23:15 +0200 comments modified
nipkow [Fri, 31 Mar 2000 10:23:15 +0200] rev 8631
comments modified
Fri, 31 Mar 2000 10:17:32 +0200 tuned
kleing [Fri, 31 Mar 2000 10:17:32 +0200] rev 8630
tuned
Fri, 31 Mar 2000 10:15:33 +0200 included new stanford mirror, mirror links now point to source directly
kleing [Fri, 31 Mar 2000 10:15:33 +0200] rev 8629
included new stanford mirror, mirror links now point to source directly
Fri, 31 Mar 2000 10:08:26 +0200 updated recdef
nipkow [Fri, 31 Mar 2000 10:08:26 +0200] rev 8628
updated recdef
Thu, 30 Mar 2000 21:26:10 +0200 tuned;
wenzelm [Thu, 30 Mar 2000 21:26:10 +0200] rev 8627
tuned;
Thu, 30 Mar 2000 20:06:27 +0200 recdef
nipkow [Thu, 30 Mar 2000 20:06:27 +0200] rev 8626
recdef
Thu, 30 Mar 2000 19:47:17 +0200 If all termination conditions are proved automatically,
nipkow [Thu, 30 Mar 2000 19:47:17 +0200] rev 8625
If all termination conditions are proved automatically, the recusrion equations are added to the simpset automatically. recdef.rules -> recdef.simps
Thu, 30 Mar 2000 19:45:51 +0200 recdef.rules -> recdef.simps
nipkow [Thu, 30 Mar 2000 19:45:51 +0200] rev 8624
recdef.rules -> recdef.simps
Thu, 30 Mar 2000 19:45:18 +0200 mod in recdef allows to access the correct simpset via simpset().
nipkow [Thu, 30 Mar 2000 19:45:18 +0200] rev 8623
mod in recdef allows to access the correct simpset via simpset().
Thu, 30 Mar 2000 19:44:11 +0200 the simplification rules returned from TFL are now paired with the row they
nipkow [Thu, 30 Mar 2000 19:44:11 +0200] rev 8622
the simplification rules returned from TFL are now paired with the row they came from.
Thu, 30 Mar 2000 15:13:59 +0200 * Isar/Pure: local results and corresponding term bindings are now
wenzelm [Thu, 30 Mar 2000 15:13:59 +0200] rev 8621
* Isar/Pure: local results and corresponding term bindings are now subject to Hindley-Milner polymorphism (similar to ML); this accommodates incremental type-inference nicely; * Isar/Pure: new calculational elements 'moreover' and 'ultimately' support plain accumulation of results, without applying any rules yet;
Thu, 30 Mar 2000 15:13:02 +0200 support Hindley-Milner polymorphisms in results and bindings;
wenzelm [Thu, 30 Mar 2000 15:13:02 +0200] rev 8620
support Hindley-Milner polymorphisms in results and bindings;
Thu, 30 Mar 2000 15:12:20 +0200 added 'moreover' and 'ultimately';
wenzelm [Thu, 30 Mar 2000 15:12:20 +0200] rev 8619
added 'moreover' and 'ultimately';
Thu, 30 Mar 2000 15:11:48 +0200 added \MOREOVER, \ULTIMATELY;
wenzelm [Thu, 30 Mar 2000 15:11:48 +0200] rev 8618
added \MOREOVER, \ULTIMATELY;
(0) -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 +30000 tip