Fri, 01 Nov 1996 15:15:39 +0100 Replaced min by Int.min
paulson [Fri, 01 Nov 1996 15:15:39 +0100] rev 2143
Replaced min by Int.min
Fri, 01 Nov 1996 15:14:25 +0100 Deleted Olist constructor. Replaced minidx by "above" function
paulson [Fri, 01 Nov 1996 15:14:25 +0100] rev 2142
Deleted Olist constructor. Replaced minidx by "above" function
Fri, 01 Nov 1996 15:12:21 +0100 Now defines structure Int
paulson [Fri, 01 Nov 1996 15:12:21 +0100] rev 2141
Now defines structure Int
Wed, 30 Oct 1996 11:21:24 +0100 Changed some mem calls to mem_int for greater efficiency (not that it could matter)
paulson [Wed, 30 Oct 1996 11:21:24 +0100] rev 2140
Changed some mem calls to mem_int for greater efficiency (not that it could matter)
Wed, 30 Oct 1996 11:20:27 +0100 Only calls nodup_Vars if really necessary. We get a speedup of nearly 6%
paulson [Wed, 30 Oct 1996 11:20:27 +0100] rev 2139
Only calls nodup_Vars if really necessary. We get a speedup of nearly 6%
Wed, 30 Oct 1996 11:19:09 +0100 Changed some mem calls to mem_string for greater efficiency (not that it could matter)
paulson [Wed, 30 Oct 1996 11:19:09 +0100] rev 2138
Changed some mem calls to mem_string for greater efficiency (not that it could matter)
Wed, 30 Oct 1996 11:17:54 +0100 Minor updates
paulson [Wed, 30 Oct 1996 11:17:54 +0100] rev 2137
Minor updates
Wed, 30 Oct 1996 11:15:09 +0100 Updated references
paulson [Wed, 30 Oct 1996 11:15:09 +0100] rev 2136
Updated references
Mon, 28 Oct 1996 15:59:39 +0100 Minor corrections
paulson [Mon, 28 Oct 1996 15:59:39 +0100] rev 2135
Minor corrections
Mon, 28 Oct 1996 15:36:18 +0100 Renamed and shuffled a few thms.
nipkow [Mon, 28 Oct 1996 15:36:18 +0100] rev 2134
Renamed and shuffled a few thms.
Mon, 28 Oct 1996 13:02:37 +0100 Simplified proofs
paulson [Mon, 28 Oct 1996 13:02:37 +0100] rev 2133
Simplified proofs
Mon, 28 Oct 1996 13:01:25 +0100 Tidied up a big mess in UN_parts_sees_Says
paulson [Mon, 28 Oct 1996 13:01:25 +0100] rev 2132
Tidied up a big mess in UN_parts_sees_Says
Mon, 28 Oct 1996 12:55:24 +0100 Changing from the Reveal to the Oops rule
paulson [Mon, 28 Oct 1996 12:55:24 +0100] rev 2131
Changing from the Reveal to the Oops rule
Sun, 27 Oct 1996 13:47:02 +0100 Simplifid proofs.
nipkow [Sun, 27 Oct 1996 13:47:02 +0100] rev 2130
Simplifid proofs.
Fri, 25 Oct 1996 15:02:09 +0200 Added (? x. t=x) = True
nipkow [Fri, 25 Oct 1996 15:02:09 +0200] rev 2129
Added (? x. t=x) = True
Thu, 24 Oct 1996 11:41:43 +0200 Documents the use of negative arguments to choplev and prlev
paulson [Thu, 24 Oct 1996 11:41:43 +0200] rev 2128
Documents the use of negative arguments to choplev and prlev
Thu, 24 Oct 1996 10:43:38 +0200 Changed comment to illustrate use of pathname
paulson [Thu, 24 Oct 1996 10:43:38 +0200] rev 2127
Changed comment to illustrate use of pathname
Thu, 24 Oct 1996 10:42:42 +0200 Allowing negative levels (as offsets) in prlev and choplev
paulson [Thu, 24 Oct 1996 10:42:42 +0200] rev 2126
Allowing negative levels (as offsets) in prlev and choplev
Thu, 24 Oct 1996 10:38:35 +0200 New Oops message, with Server as source to ensure
paulson [Thu, 24 Oct 1996 10:38:35 +0200] rev 2125
New Oops message, with Server as source to ensure correct nonces
Thu, 24 Oct 1996 10:36:29 +0200 New theorem Crypt_Spy_analz_lost; improvements to spy_analz_tac; ex_strip_tac
paulson [Thu, 24 Oct 1996 10:36:29 +0200] rev 2124
New theorem Crypt_Spy_analz_lost; improvements to spy_analz_tac; ex_strip_tac
Thu, 24 Oct 1996 10:33:27 +0200 Two new protocol variants
paulson [Thu, 24 Oct 1996 10:33:27 +0200] rev 2123
Two new protocol variants
Thu, 24 Oct 1996 10:31:17 +0200 Moved ex_strip_tac to the common part
paulson [Thu, 24 Oct 1996 10:31:17 +0200] rev 2122
Moved ex_strip_tac to the common part
Thu, 24 Oct 1996 10:30:43 +0200 Removal of unused predicate isSpy
paulson [Thu, 24 Oct 1996 10:30:43 +0200] rev 2121
Removal of unused predicate isSpy
Thu, 24 Oct 1996 10:30:17 +0200 Handles pathnames in ISABELLECOMP
paulson [Thu, 24 Oct 1996 10:30:17 +0200] rev 2120
Handles pathnames in ISABELLECOMP
Mon, 21 Oct 1996 11:37:21 +0200 Mentions the possibility of pathnames in ISABELLECOMP;
paulson [Mon, 21 Oct 1996 11:37:21 +0200] rev 2119
Mentions the possibility of pathnames in ISABELLECOMP;
Mon, 21 Oct 1996 11:36:57 +0200 Creates a bigger main window
paulson [Mon, 21 Oct 1996 11:36:57 +0200] rev 2118
Creates a bigger main window
Mon, 21 Oct 1996 11:18:34 +0200 ISABELLECOMP may now have a leading pathname
paulson [Mon, 21 Oct 1996 11:18:34 +0200] rev 2117
ISABELLECOMP may now have a leading pathname
Mon, 21 Oct 1996 09:51:18 +0200 Used trans_tac (see Provers/nat_transitive.ML) to automate arithmetic.
nipkow [Mon, 21 Oct 1996 09:51:18 +0200] rev 2116
Used trans_tac (see Provers/nat_transitive.ML) to automate arithmetic.
Mon, 21 Oct 1996 09:50:50 +0200 Added trans_tac (see Provers/nat_transitive.ML)
nipkow [Mon, 21 Oct 1996 09:50:50 +0200] rev 2115
Added trans_tac (see Provers/nat_transitive.ML)
Mon, 21 Oct 1996 09:49:41 +0200 Solves simple arithmetic goals.
nipkow [Mon, 21 Oct 1996 09:49:41 +0200] rev 2114
Solves simple arithmetic goals.
Fri, 18 Oct 1996 12:54:19 +0200 Subst as modified by Konrad Slind
paulson [Fri, 18 Oct 1996 12:54:19 +0200] rev 2113
Subst as modified by Konrad Slind
Fri, 18 Oct 1996 12:41:04 +0200 Konrad Slind's TFL
paulson [Fri, 18 Oct 1996 12:41:04 +0200] rev 2112
Konrad Slind's TFL
Fri, 18 Oct 1996 11:43:14 +0200 New version of Yahalom, as recommended on p 259 of BAN paper
paulson [Fri, 18 Oct 1996 11:43:14 +0200] rev 2111
New version of Yahalom, as recommended on p 259 of BAN paper
Fri, 18 Oct 1996 11:42:41 +0200 Addition of Reveal message
paulson [Fri, 18 Oct 1996 11:42:41 +0200] rev 2110
Addition of Reveal message
Fri, 18 Oct 1996 11:42:17 +0200 Deleted obsolete rewrites (they are now in HOL/simpdata)
paulson [Fri, 18 Oct 1996 11:42:17 +0200] rev 2109
Deleted obsolete rewrites (they are now in HOL/simpdata)
Fri, 18 Oct 1996 11:41:41 +0200 Reveal -> Revl
paulson [Fri, 18 Oct 1996 11:41:41 +0200] rev 2108
Reveal -> Revl
Fri, 18 Oct 1996 11:41:04 +0200 The new proof of the lemma for new_nonces_not_seen is faster
paulson [Fri, 18 Oct 1996 11:41:04 +0200] rev 2107
The new proof of the lemma for new_nonces_not_seen is faster
Fri, 18 Oct 1996 11:39:55 +0200 Generaly tidying up
paulson [Fri, 18 Oct 1996 11:39:55 +0200] rev 2106
Generaly tidying up
Fri, 18 Oct 1996 11:39:10 +0200 Important correction to comment
paulson [Fri, 18 Oct 1996 11:39:10 +0200] rev 2105
Important correction to comment
Fri, 18 Oct 1996 11:38:17 +0200 Replaced excluded_middle_tac by case_tac; tidied proofs
paulson [Fri, 18 Oct 1996 11:38:17 +0200] rev 2104
Replaced excluded_middle_tac by case_tac; tidied proofs
Fri, 18 Oct 1996 11:37:19 +0200 Tidied up the proof of A_trust_NS4
paulson [Fri, 18 Oct 1996 11:37:19 +0200] rev 2103
Tidied up the proof of A_trust_NS4
Fri, 18 Oct 1996 11:33:02 +0200 Replaced excluded_middle_tac by case_tac
paulson [Fri, 18 Oct 1996 11:33:02 +0200] rev 2102
Replaced excluded_middle_tac by case_tac
Fri, 18 Oct 1996 11:32:38 +0200 Moving the CPUtimer declaration into cond_timeit should
paulson [Fri, 18 Oct 1996 11:32:38 +0200] rev 2101
Moving the CPUtimer declaration into cond_timeit should prevent the problems that caused exn TIME to be raised
Fri, 18 Oct 1996 11:31:33 +0200 Now checks that $LISTEN is set
paulson [Fri, 18 Oct 1996 11:31:33 +0200] rev 2100
Now checks that $LISTEN is set
Wed, 16 Oct 1996 10:37:17 +0200 Defined pred using nat_case rather than nat_rec.
nipkow [Wed, 16 Oct 1996 10:37:17 +0200] rev 2099
Defined pred using nat_case rather than nat_rec. Added expand_nat_case
Tue, 15 Oct 1996 16:40:04 +0200 corrected `correction` of o_assoc (of version 1.14),
oheimb [Tue, 15 Oct 1996 16:40:04 +0200] rev 2098
corrected `correction` of o_assoc (of version 1.14), (this change has actually been done in the previous commit 1.25)
Tue, 15 Oct 1996 16:32:59 +0200 bound o_apply theorem to thy
oheimb [Tue, 15 Oct 1996 16:32:59 +0200] rev 2097
bound o_apply theorem to thy
Tue, 15 Oct 1996 10:58:59 +0200 Removed extraneous spaces from all Makefiles
paulson [Tue, 15 Oct 1996 10:58:59 +0200] rev 2096
Removed extraneous spaces from all Makefiles
(0) -1000 -300 -100 -48 +48 +100 +300 +1000 +3000 +10000 +30000 tip