haftmann [Mon, 22 Oct 2007 16:54:54 +0200] rev 25147
clarified Haskell qualification heuristics
haftmann [Mon, 22 Oct 2007 16:54:52 +0200] rev 25146
tuned abbreviations in class context
haftmann [Mon, 22 Oct 2007 16:54:50 +0200] rev 25145
dropped superfluous inlining lemmas
wenzelm [Mon, 22 Oct 2007 15:27:11 +0200] rev 25144
removed empty files;
wenzelm [Mon, 22 Oct 2007 15:24:58 +0200] rev 25143
abbrevs within inductive definitions may no longer depend on each other (reflects in internal organization, particularly for output);
wenzelm [Mon, 22 Oct 2007 15:24:55 +0200] rev 25142
added @{sort}, @{type_syntax} antiquotations;
nipkow [Mon, 22 Oct 2007 13:59:41 +0200] rev 25141
>0 -> ~=0
nipkow [Sun, 21 Oct 2007 22:33:35 +0200] rev 25140
More changes from >0 to ~=0::nat
urbanc [Sun, 21 Oct 2007 19:32:19 +0200] rev 25139
tuned
urbanc [Sun, 21 Oct 2007 19:12:05 +0200] rev 25138
further comments
urbanc [Sun, 21 Oct 2007 19:04:53 +0200] rev 25137
polished the proofs and added a version of the weakening lemma that does not use the variable convention
wenzelm [Sun, 21 Oct 2007 17:48:11 +0200] rev 25136
fixed proof: neq0_conv;
wenzelm [Sun, 21 Oct 2007 16:27:42 +0200] rev 25135
modernized specifications ('definition', 'axiomatization');
nipkow [Sun, 21 Oct 2007 14:53:44 +0200] rev 25134
Eliminated most of the neq0_conv occurrences. As a result, many
theorems had to be rephrased with ~= 0 instead of > 0.