| Mon, 17 Jun 1996 16:50:08 +0200 |
paulson |
Converted to use constdefs instead of defs
|
changeset |
files
|
| Fri, 14 Jun 1996 12:37:21 +0200 |
paulson |
Explicitly included add_mult_distrib & add_mult_distrib2
|
changeset |
files
|
| Fri, 14 Jun 1996 12:34:56 +0200 |
paulson |
New example of greatest common divisor
|
changeset |
files
|
| Fri, 14 Jun 1996 12:32:08 +0200 |
paulson |
Added Primes to list of theories in target ex
|
changeset |
files
|
| Fri, 14 Jun 1996 12:27:48 +0200 |
paulson |
Now del_simp catches the right exception!
|
changeset |
files
|
| Fri, 14 Jun 1996 12:27:11 +0200 |
paulson |
Added delete function for brls
|
changeset |
files
|
| Fri, 14 Jun 1996 12:26:06 +0200 |
paulson |
Now implements delrules
|
changeset |
files
|
| Fri, 14 Jun 1996 12:25:19 +0200 |
paulson |
Added new Primes theory
|
changeset |
files
|
| Fri, 14 Jun 1996 12:25:02 +0200 |
paulson |
Explicitly included add_mult_distrib & add_mult_distrib2
|
changeset |
files
|
| Fri, 14 Jun 1996 12:23:31 +0200 |
paulson |
Updated list of theories for target ex
|
changeset |
files
|
| Fri, 14 Jun 1996 12:22:59 +0200 |
paulson |
Tidied spacing
|
changeset |
files
|
| Fri, 14 Jun 1996 12:22:42 +0200 |
paulson |
New lemmas for gcd example
|
changeset |
files
|
| Fri, 14 Jun 1996 12:21:02 +0200 |
paulson |
Obsolete relics concerned with recursion
|
changeset |
files
|
| Thu, 13 Jun 1996 16:22:37 +0200 |
paulson |
New example of GCDs and divides relation
|
changeset |
files
|
| Thu, 13 Jun 1996 14:25:45 +0200 |
paulson |
The "divides" relation, the greatest common divisor and Euclid's algorithm
|
changeset |
files
|
| Fri, 07 Jun 1996 10:56:37 +0200 |
paulson |
Addition of converse_iff, domain_converse, range_converse as rewrites
|
changeset |
files
|
| Thu, 06 Jun 1996 16:20:27 +0200 |
paulson |
Quotes now optional around inductive set
|
changeset |
files
|
| Thu, 06 Jun 1996 14:39:44 +0200 |
paulson |
Quotes now optional around inductive set
|
changeset |
files
|
| Thu, 06 Jun 1996 13:13:18 +0200 |
paulson |
Quotes now optional around inductive set
|
changeset |
files
|
| Tue, 04 Jun 1996 12:49:04 +0200 |
paulson |
Tidied some proofs
|
changeset |
files
|
| Mon, 03 Jun 1996 17:10:56 +0200 |
berghofe |
best_tac, deepen_tac and safe_tac now also use default claset.
|
changeset |
files
|
| Mon, 03 Jun 1996 11:44:44 +0200 |
paulson |
Shortened some proofs
|
changeset |
files
|
| Mon, 03 Jun 1996 11:43:55 +0200 |
paulson |
Added a new theorem, UN_Int_subset
|
changeset |
files
|
| Mon, 03 Jun 1996 11:41:26 +0200 |
paulson |
Used 2 instead of Suc(Suc 0)
|
changeset |
files
|
| Mon, 03 Jun 1996 11:41:00 +0200 |
paulson |
Shortened a proof
|
changeset |
files
|
| Fri, 31 May 1996 20:25:59 +0200 |
oheimb |
adapted use of monofun_cfun_arg
|
changeset |
files
|
| Fri, 31 May 1996 20:14:42 +0200 |
oheimb |
adapted proof of flat_codom
|
changeset |
files
|
| Fri, 31 May 1996 19:55:19 +0200 |
oheimb |
introduced forgotten bind_thm calls
|
changeset |
files
|
| Fri, 31 May 1996 19:47:23 +0200 |
oheimb |
adapted some proofs for new simplifier
|
changeset |
files
|
| Fri, 31 May 1996 19:34:40 +0200 |
oheimb |
renamed le_0 to le_0_eq, to avoid confusion with le0,
|
changeset |
files
|
| Fri, 31 May 1996 19:12:00 +0200 |
oheimb |
moved mem_simps and the corresponding update of !simpset from Fun.ML to Set.ML,
|
changeset |
files
|
| Thu, 30 May 1996 13:31:29 +0200 |
nipkow |
Smaller logo
|
changeset |
files
|