paulson [Thu, 24 Oct 1996 11:41:43 +0200] rev 2128
Documents the use of negative arguments to choplev and prlev
paulson [Thu, 24 Oct 1996 10:43:38 +0200] rev 2127
Changed comment to illustrate use of pathname
paulson [Thu, 24 Oct 1996 10:42:42 +0200] rev 2126
Allowing negative levels (as offsets) in prlev and choplev
paulson [Thu, 24 Oct 1996 10:38:35 +0200] rev 2125
New Oops message, with Server as source to ensure
correct nonces
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
paulson [Thu, 24 Oct 1996 10:33:27 +0200] rev 2123
Two new protocol variants
paulson [Thu, 24 Oct 1996 10:31:17 +0200] rev 2122
Moved ex_strip_tac to the common part
paulson [Thu, 24 Oct 1996 10:30:43 +0200] rev 2121
Removal of unused predicate isSpy
paulson [Thu, 24 Oct 1996 10:30:17 +0200] rev 2120
Handles pathnames in ISABELLECOMP
paulson [Mon, 21 Oct 1996 11:37:21 +0200] rev 2119
Mentions the possibility of pathnames in ISABELLECOMP;
paulson [Mon, 21 Oct 1996 11:36:57 +0200] rev 2118
Creates a bigger main window
paulson [Mon, 21 Oct 1996 11:18:34 +0200] rev 2117
ISABELLECOMP may now have a leading pathname
nipkow [Mon, 21 Oct 1996 09:51:18 +0200] rev 2116
Used trans_tac (see Provers/nat_transitive.ML) to automate arithmetic.
nipkow [Mon, 21 Oct 1996 09:50:50 +0200] rev 2115
Added trans_tac (see Provers/nat_transitive.ML)
nipkow [Mon, 21 Oct 1996 09:49:41 +0200] rev 2114
Solves simple arithmetic goals.
paulson [Fri, 18 Oct 1996 12:54:19 +0200] rev 2113
Subst as modified by Konrad Slind
paulson [Fri, 18 Oct 1996 12:41:04 +0200] rev 2112
Konrad Slind's TFL
paulson [Fri, 18 Oct 1996 11:43:14 +0200] rev 2111
New version of Yahalom, as recommended on p 259 of BAN paper
paulson [Fri, 18 Oct 1996 11:42:41 +0200] rev 2110
Addition of Reveal message
paulson [Fri, 18 Oct 1996 11:42:17 +0200] rev 2109
Deleted obsolete rewrites (they are now in HOL/simpdata)
paulson [Fri, 18 Oct 1996 11:41:41 +0200] rev 2108
Reveal -> Revl
paulson [Fri, 18 Oct 1996 11:41:04 +0200] rev 2107
The new proof of the lemma for new_nonces_not_seen is faster
paulson [Fri, 18 Oct 1996 11:39:55 +0200] rev 2106
Generaly tidying up
paulson [Fri, 18 Oct 1996 11:39:10 +0200] rev 2105
Important correction to comment