wenzelm [Thu, 30 Mar 2000 21:26:10 +0200] rev 8627
tuned;
nipkow [Thu, 30 Mar 2000 20:06:27 +0200] rev 8626
recdef
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
nipkow [Thu, 30 Mar 2000 19:45:51 +0200] rev 8624
recdef.rules -> recdef.simps
nipkow [Thu, 30 Mar 2000 19:45:18 +0200] rev 8623
mod in recdef allows to access the correct simpset via simpset().
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.
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;
wenzelm [Thu, 30 Mar 2000 15:13:02 +0200] rev 8620
support Hindley-Milner polymorphisms in results and bindings;
wenzelm [Thu, 30 Mar 2000 15:12:20 +0200] rev 8619
added 'moreover' and 'ultimately';
wenzelm [Thu, 30 Mar 2000 15:11:48 +0200] rev 8618
added \MOREOVER, \ULTIMATELY;