Fri, 20 Feb 2009 14:49:24 +0100 reverted to old wellsorting algorithm
haftmann [Fri, 20 Feb 2009 14:49:24 +0100] rev 30013
reverted to old wellsorting algorithm
Fri, 20 Feb 2009 14:49:23 +0100 fixed spurious proof failure
haftmann [Fri, 20 Feb 2009 14:49:23 +0100] rev 30012
fixed spurious proof failure
Fri, 20 Feb 2009 14:49:23 +0100 consider changes variable names in theorem le_imp_power_dvd
haftmann [Fri, 20 Feb 2009 14:49:23 +0100] rev 30011
consider changes variable names in theorem le_imp_power_dvd
Fri, 20 Feb 2009 10:14:32 +0100 tuned and incremental version of wellsorting algorithm
haftmann [Fri, 20 Feb 2009 10:14:32 +0100] rev 30010
tuned and incremental version of wellsorting algorithm
Fri, 20 Feb 2009 10:14:32 +0100 ignore sorts in bare types
haftmann [Fri, 20 Feb 2009 10:14:32 +0100] rev 30009
ignore sorts in bare types
Fri, 20 Feb 2009 10:14:32 +0100 defensive implementation of pretty serialisation of lists and characters
haftmann [Fri, 20 Feb 2009 10:14:32 +0100] rev 30008
defensive implementation of pretty serialisation of lists and characters
Fri, 20 Feb 2009 10:14:31 +0100 dropped Id
haftmann [Fri, 20 Feb 2009 10:14:31 +0100] rev 30007
dropped Id
Fri, 20 Feb 2009 10:14:31 +0100 experimental inclusion of new wellsorting algorithm for code equations
haftmann [Fri, 20 Feb 2009 10:14:31 +0100] rev 30006
experimental inclusion of new wellsorting algorithm for code equations
Fri, 20 Feb 2009 13:14:57 +0000 merged
chaieb [Fri, 20 Feb 2009 13:14:57 +0000] rev 30005
merged
Tue, 17 Feb 2009 21:51:48 +0000 merged
chaieb [Tue, 17 Feb 2009 21:51:48 +0000] rev 30004
merged
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip