Fri, 23 May 2008 16:05:11 +0200 more permissive preprocessor
haftmann [Fri, 23 May 2008 16:05:11 +0200] rev 26971
more permissive preprocessor
Fri, 23 May 2008 16:05:07 +0200 explicit type schemes for functions
haftmann [Fri, 23 May 2008 16:05:07 +0200] rev 26970
explicit type schemes for functions
Fri, 23 May 2008 16:05:04 +0200 moved case distinction over number of constructors for distinctness rules from DatatypeProp to DatatypeRepProofs
haftmann [Fri, 23 May 2008 16:05:04 +0200] rev 26969
moved case distinction over number of constructors for distinctness rules from DatatypeProp to DatatypeRepProofs
Fri, 23 May 2008 16:05:02 +0200 added code for quantifiers
haftmann [Fri, 23 May 2008 16:05:02 +0200] rev 26968
added code for quantifiers
Fri, 23 May 2008 16:04:59 +0200 simplified proof
haftmann [Fri, 23 May 2008 16:04:59 +0200] rev 26967
simplified proof
Thu, 22 May 2008 16:34:41 +0200 made the naming of the induction principles consistent: weak_induct is
urbanc [Thu, 22 May 2008 16:34:41 +0200] rev 26966
made the naming of the induction principles consistent: weak_induct is induct and induct is strong_induct
Wed, 21 May 2008 22:04:58 +0200 use_file: added str_of_pos argument (ignored);
gagern [Wed, 21 May 2008 22:04:58 +0200] rev 26965
use_file: added str_of_pos argument (ignored);
Wed, 21 May 2008 14:04:41 +0200 Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe [Wed, 21 May 2008 14:04:41 +0200] rev 26964
Added entry explaining incompatibilities introduced by replacing sets by predicates.
Mon, 19 May 2008 23:50:06 +0200 instantiation lift :: (countable) bifinite
huffman [Mon, 19 May 2008 23:50:06 +0200] rev 26963
instantiation lift :: (countable) bifinite
Mon, 19 May 2008 23:49:20 +0200 use new class package for classes profinite, bifinite; remove approx class
huffman [Mon, 19 May 2008 23:49:20 +0200] rev 26962
use new class package for classes profinite, bifinite; remove approx class
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip