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