wenzelm [Wed, 09 Jul 1997 16:54:17 +0200] rev 3510
improved type checking errors;
wenzelm [Wed, 09 Jul 1997 16:53:53 +0200] rev 3509
removed init_pps;
wenzelm [Wed, 09 Jul 1997 16:52:51 +0200] rev 3508
removed init_database;
nipkow [Wed, 09 Jul 1997 12:57:04 +0200] rev 3507
Improved length = size translation.
paulson [Mon, 07 Jul 1997 10:49:14 +0200] rev 3506
New proofs involving CERTIFICATE VERIFY
wenzelm [Mon, 07 Jul 1997 09:09:21 +0200] rev 3505
eliminated chmod -w;
wenzelm [Mon, 07 Jul 1997 09:07:08 +0200] rev 3504
-w option;
wenzelm [Mon, 07 Jul 1997 09:06:26 +0200] rev 3503
NOWRITE;
wenzelm [Mon, 07 Jul 1997 09:05:16 +0200] rev 3502
added -w option;
paulson [Fri, 04 Jul 1997 17:36:41 +0200] rev 3501
Changed some variables of type msg to lower case (e.g. from NB to nb
paulson [Fri, 04 Jul 1997 17:34:55 +0200] rev 3500
New constant "certificate"--just an abbreviation
nipkow [Fri, 04 Jul 1997 14:37:30 +0200] rev 3499
Reduced priority of postfix ^* etc operators such that they are the same as
application. Eg wf r^* now needs to be written wf(r^*).
paulson [Fri, 04 Jul 1997 12:36:00 +0200] rev 3498
Automatic update
paulson [Fri, 04 Jul 1997 12:32:31 +0200] rev 3497
Now catches the error of calling tgoalw when there are no goals to prove,
instead of just letting USyntax.list_mk_conj raise an exception
paulson [Fri, 04 Jul 1997 12:31:20 +0200] rev 3496
Simplified the new proofs about division
paulson [Fri, 04 Jul 1997 11:57:33 +0200] rev 3495
New comments on how to deal with unproved termination conditions
paulson [Fri, 04 Jul 1997 11:56:49 +0200] rev 3494
Fixed comments
paulson [Fri, 04 Jul 1997 11:56:18 +0200] rev 3493
Moved MLWorks.ML to its proper place, directory ML-Systems.
Note that MLWorks does not quite work yet, especially top-level pretty
printing
paulson [Fri, 04 Jul 1997 11:54:43 +0200] rev 3492
Automatic update
paulson [Thu, 03 Jul 1997 17:21:14 +0200] rev 3491
Modified the \tydx command to set types in italics instead of \tt
paulson [Thu, 03 Jul 1997 17:20:07 +0200] rev 3490
Some LaTeX-2e primitives such as \texttt
A bit of material on theories Primes and Primrec
paulson [Thu, 03 Jul 1997 17:17:45 +0200] rev 3489
Added documentation for recdef, and tidied some other material
paulson [Thu, 03 Jul 1997 17:10:50 +0200] rev 3488
Updated references
nipkow [Thu, 03 Jul 1997 13:44:54 +0200] rev 3487
set_of_list -> set
paulson [Wed, 02 Jul 1997 16:53:14 +0200] rev 3486
Now there are TWO spaces after each full stop, so that the Emacs sentence
primitives work
paulson [Wed, 02 Jul 1997 16:46:36 +0200] rev 3485
Now there are TWO spaces after each full stop, so that the Emacs sentence
primitives work
nipkow [Wed, 02 Jul 1997 11:59:10 +0200] rev 3484
Added the following lemmas tp Divides and a few others to Arith and NatDef:
div_le_mono, div_le_mono2, div_le_dividend, div_less_dividend
Fixed a broken proof in WF_Rel.ML. No idea what caused this.
paulson [Tue, 01 Jul 1997 17:59:36 +0200] rev 3483
Tidying; also simplified the lemma Says_Server_not
paulson [Tue, 01 Jul 1997 17:42:36 +0200] rev 3482
New theory TLS
paulson [Tue, 01 Jul 1997 17:38:49 +0200] rev 3481
Deleted a redundant A~=B in rules that refer to a previous event
paulson [Tue, 01 Jul 1997 17:37:42 +0200] rev 3480
More realistic model: the Spy can compute clientK and serverK
paulson [Tue, 01 Jul 1997 17:36:42 +0200] rev 3479
Reordered rules in analz_image_freshK_ss to improve clarity
paulson [Tue, 01 Jul 1997 17:35:09 +0200] rev 3478
Removal of the obsolete newN function
paulson [Tue, 01 Jul 1997 17:34:42 +0200] rev 3477
New theorem priK_inj_eq, injectivity of priK
paulson [Tue, 01 Jul 1997 17:34:13 +0200] rev 3476
spy_analz_tac: Restored iffI to the list of rules used to break down
the subgoal
paulson [Tue, 01 Jul 1997 17:32:12 +0200] rev 3475
New theory TLS
paulson [Tue, 01 Jul 1997 11:11:42 +0200] rev 3474
Baby TLS. Proofs work, but model seems unrealistic
paulson [Tue, 01 Jul 1997 10:45:59 +0200] rev 3473
New and stronger lemmas; more default simp/cla rules
paulson [Tue, 01 Jul 1997 10:39:28 +0200] rev 3472
Deleted the obsolete operators newK, newN and nPair
paulson [Tue, 01 Jul 1997 10:38:11 +0200] rev 3471
Now the possibility proof calls the appropriate tactic
paulson [Tue, 01 Jul 1997 10:37:42 +0200] rev 3470
Added a comment
paulson [Tue, 01 Jul 1997 10:37:03 +0200] rev 3469
Now Collect_mem_eq is a default simprule (how could it have ever been omitted?
paulson [Tue, 01 Jul 1997 10:34:30 +0200] rev 3468
New laws for the "lists" operator
nipkow [Mon, 30 Jun 1997 12:08:19 +0200] rev 3467
More concat lemmas.
paulson [Fri, 27 Jun 1997 10:47:13 +0200] rev 3466
Corrected indentations and margins after the renaming of "set_of_list"
nipkow [Thu, 26 Jun 1997 13:20:50 +0200] rev 3465
set_of_list -> set
paulson [Thu, 26 Jun 1997 11:58:05 +0200] rev 3464
Trivial changes in connection with the Yahalom paper.
Changed the order of the premises in no_nonce_YM1_YM2.
Installed B_trusts_YM4_newK using bind_thm.
Improved some comments.
wenzelm [Thu, 26 Jun 1997 11:15:55 +0200] rev 3463
oops;
wenzelm [Thu, 26 Jun 1997 11:14:46 +0200] rev 3462
rearrange pages of ps file to be printed as booklet (duplex);
nipkow [Thu, 26 Jun 1997 10:43:15 +0200] rev 3461
amdI -> admI2
nipkow [Thu, 26 Jun 1997 10:42:50 +0200] rev 3460
Tuned Franz's proofs.
paulson [Mon, 23 Jun 1997 11:33:59 +0200] rev 3459
Removal of structure Context and its replacement by a theorem list of
congruence rules for use in CONTEXT_REWRITE_RULE (where definitions are
processed)
paulson [Mon, 23 Jun 1997 11:30:35 +0200] rev 3458
Removal of COND_CONG, which is just if_cong RS eq_reflection
paulson [Mon, 23 Jun 1997 10:42:03 +0200] rev 3457
Ran expandshort
paulson [Mon, 23 Jun 1997 10:35:49 +0200] rev 3456
New "congs" keyword for recdef theory section
wenzelm [Fri, 20 Jun 1997 13:19:31 +0200] rev 3455
removed old Makefile;
wenzelm [Fri, 20 Jun 1997 11:37:53 +0200] rev 3454
removed;
wenzelm [Fri, 20 Jun 1997 11:34:05 +0200] rev 3453
removed old Makefile;
wenzelm [Fri, 20 Jun 1997 11:19:39 +0200] rev 3452
removed old Makefile and compat files;
paulson [Thu, 19 Jun 1997 11:31:14 +0200] rev 3451
Made proofs more concise by replacing calls to spy_analz_tac by uses of
analz_insert_eq in rewriting