Mon, 08 May 2000 16:59:02 +0200 |
paulson |
tidied
|
file |
diff |
annotate
|
Tue, 02 May 2000 18:44:33 +0200 |
paulson |
a more modern proof
|
file |
diff |
annotate
|
Sun, 23 Apr 2000 11:41:06 +0200 |
paulson |
[Int_CC.sum_conv, Int_CC.rel_conv] no longer exist
|
file |
diff |
annotate
|
Wed, 01 Sep 1999 11:16:02 +0200 |
paulson |
tidied some proofs
|
file |
diff |
annotate
|
Mon, 16 Aug 1999 18:47:20 +0200 |
paulson |
deleted obsolete assignment
|
file |
diff |
annotate
|
Thu, 05 Aug 1999 22:11:43 +0200 |
wenzelm |
removed obsolete addsimps update_defs;
|
file |
diff |
annotate
|
Fri, 23 Jul 1999 17:31:51 +0200 |
paulson |
removed the combine_coeff simproc because linear arith does not handle
|
file |
diff |
annotate
|
Wed, 14 Jul 1999 10:41:33 +0200 |
paulson |
rewrite add1_zle_eq is no longer in the default simpset
|
file |
diff |
annotate
|
Thu, 08 Jul 1999 13:42:31 +0200 |
paulson |
tidied proofs to cope with default if_weak_cong
|
file |
diff |
annotate
|
Thu, 27 May 1999 11:22:10 +0200 |
paulson |
removal of Always_StableI
|
file |
diff |
annotate
|
Mon, 24 May 1999 15:56:24 +0200 |
paulson |
renamed Lprg to Lift; simplified proof of Always_nonneg
|
file |
diff |
annotate
|
Fri, 21 May 1999 10:56:46 +0200 |
paulson |
preferring generic rules to specific ones...
|
file |
diff |
annotate
|
Fri, 07 May 1999 10:50:28 +0200 |
paulson |
tidied
|
file |
diff |
annotate
|
Tue, 04 May 1999 10:26:00 +0200 |
paulson |
Invariant -> Always and other tidying
|
file |
diff |
annotate
|
Thu, 29 Apr 1999 10:51:58 +0200 |
paulson |
made many specification operators infix
|
file |
diff |
annotate
|
Fri, 29 Jan 1999 16:23:56 +0100 |
paulson |
tidied
|
file |
diff |
annotate
|
Tue, 19 Jan 1999 11:16:07 +0100 |
paulson |
simplified thanks to the arithmetic prover
|
file |
diff |
annotate
|
Thu, 14 Jan 1999 14:39:11 +0100 |
nipkow |
Removed superfluous arith rules from metric_simps
|
file |
diff |
annotate
|
Thu, 14 Jan 1999 13:18:09 +0100 |
nipkow |
More arith refinements.
|
file |
diff |
annotate
|
Tue, 05 Jan 1999 17:28:34 +0100 |
nipkow |
1 proof now automatic.
|
file |
diff |
annotate
|
Fri, 11 Dec 1998 10:41:53 +0100 |
paulson |
new Close_locale synatx
|
file |
diff |
annotate
|
Sat, 31 Oct 1998 12:43:56 +0100 |
paulson |
no need for int_0
|
file |
diff |
annotate
|
Fri, 23 Oct 1998 20:44:34 +0200 |
oheimb |
corrected auto_tac (applications of unsafe wrappers)
|
file |
diff |
annotate
|
Wed, 21 Oct 1998 13:29:01 +0200 |
wenzelm |
record_split_name;
|
file |
diff |
annotate
|
Tue, 20 Oct 1998 17:27:00 +0200 |
wenzelm |
delSWrapper "record_split_tac";
|
file |
diff |
annotate
|
Thu, 15 Oct 1998 11:35:07 +0200 |
paulson |
specifications as sets of programs
|
file |
diff |
annotate
|
Thu, 01 Oct 1998 18:28:18 +0200 |
paulson |
abstype of programs
|
file |
diff |
annotate
|
Tue, 29 Sep 1998 15:58:25 +0200 |
paulson |
modified proof for new simproc
|
file |
diff |
annotate
|
Fri, 25 Sep 1998 13:58:24 +0200 |
paulson |
Now uses integers instead of naturals
|
file |
diff |
annotate
|
Tue, 15 Sep 1998 15:04:07 +0200 |
paulson |
From Compl(A) to -A
|
file |
diff |
annotate
|
Mon, 14 Sep 1998 10:17:44 +0200 |
paulson |
simpler proof
|
file |
diff |
annotate
|
Fri, 11 Sep 1998 18:09:54 +0200 |
paulson |
Extra steps at end to make it run faster
|
file |
diff |
annotate
|
Fri, 11 Sep 1998 16:25:40 +0200 |
paulson |
fixed PROOF FAILED
|
file |
diff |
annotate
|
Thu, 03 Sep 1998 16:40:02 +0200 |
paulson |
A new approach, using simp_of_act and simp_of_set to activate definitions when
|
file |
diff |
annotate
|
Wed, 02 Sep 1998 10:37:13 +0200 |
paulson |
modified proofs for new constrains_tac and ensures_tac
|
file |
diff |
annotate
|
Tue, 01 Sep 1998 10:10:11 +0200 |
paulson |
Moved lemmas to Arith.ML
|
file |
diff |
annotate
|
Thu, 20 Aug 1998 17:43:01 +0200 |
paulson |
New theory Lift
|
file |
diff |
annotate
|
Wed, 19 Aug 1998 10:34:31 +0200 |
paulson |
Misc changes
|
file |
diff |
annotate
|
Fri, 14 Aug 1998 13:52:42 +0200 |
paulson |
now trans_tac is part of the claset...
|
file |
diff |
annotate
|
Thu, 13 Aug 1998 18:06:40 +0200 |
paulson |
Constrains, Stable, Invariant...more of the substitution axiom, but Union
|
file |
diff |
annotate
|
Thu, 06 Aug 1998 15:47:26 +0200 |
paulson |
A higher-level treatment of LeadsTo, minimizing use of "reachable"
|
file |
diff |
annotate
|