Sat, 26 Oct 2013 12:54:21 +0200 tuned error message
blanchet [Sat, 26 Oct 2013 12:54:21 +0200] rev 54204
tuned error message
Fri, 25 Oct 2013 16:20:54 +0200 more exercises
nipkow [Fri, 25 Oct 2013 16:20:54 +0200] rev 54203
more exercises
Thu, 24 Oct 2013 19:43:21 +0200 handle applied ctor arguments gracefully when computing 'callssss' (for recursion through functions)
blanchet [Thu, 24 Oct 2013 19:43:21 +0200] rev 54202
handle applied ctor arguments gracefully when computing 'callssss' (for recursion through functions)
Thu, 24 Oct 2013 18:50:59 +0200 tuning
blanchet [Thu, 24 Oct 2013 18:50:59 +0200] rev 54201
tuning
Thu, 24 Oct 2013 18:37:54 +0200 more correct (!) types for recursive calls
blanchet [Thu, 24 Oct 2013 18:37:54 +0200] rev 54200
more correct (!) types for recursive calls
Thu, 24 Oct 2013 15:56:03 +0200 watch out for 'case' constant canditates whose general type is 'a (e.g. 'undefined')
blanchet [Thu, 24 Oct 2013 15:56:03 +0200] rev 54199
watch out for 'case' constant canditates whose general type is 'a (e.g. 'undefined')
Thu, 24 Oct 2013 15:32:34 +0200 got rid of annoying duplicate rewrite rule warnings
blanchet [Thu, 24 Oct 2013 15:32:34 +0200] rev 54198
got rid of annoying duplicate rewrite rule warnings
Thu, 24 Oct 2013 12:43:33 +0200 use definitions for LEO-II as well -- this simplifies the code and matches some users' expectations
blanchet [Thu, 24 Oct 2013 12:43:33 +0200] rev 54197
use definitions for LEO-II as well -- this simplifies the code and matches some users' expectations
Thu, 24 Oct 2013 10:03:20 +0200 refactored rtrancl_while; prove termination for finite rtrancl
traytel [Thu, 24 Oct 2013 10:03:20 +0200] rev 54196
refactored rtrancl_while; prove termination for finite rtrancl
Wed, 23 Oct 2013 21:12:20 +0200 more exercises
nipkow [Wed, 23 Oct 2013 21:12:20 +0200] rev 54195
more exercises
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip