Thu, 19 Jun 1997 11:23:31 +0200 paulson Two new rewrite rules--NOT included by default\!
Wed, 18 Jun 1997 15:38:35 +0200 paulson Defines KeyWithNonce, which is used to prove the secrecy of NB
Wed, 18 Jun 1997 15:31:31 +0200 paulson Addition of not_imp (which pushes negation into implication) as a default
Wed, 18 Jun 1997 15:30:32 +0200 paulson Corrected Title in header lines
Wed, 18 Jun 1997 15:28:03 +0200 paulson Streamlined proofs of the secrecy of NB and added authentication of A and B
Wed, 18 Jun 1997 15:24:21 +0200 paulson Removed Says_Crypt_lost and Says_Crypt_not_lost.
Wed, 18 Jun 1997 15:23:29 +0200 paulson Removed Says_Crypt_lost and Says_Crypt_not_lost.
Wed, 18 Jun 1997 15:21:30 +0200 paulson Adapted proofs to the removal of Says_Crypt_lost and Says_Crypt_not_lost
Wed, 18 Jun 1997 15:19:37 +0200 paulson Deleted spurious reference to Spy_not_see_NB, which by chance was defined
Tue, 17 Jun 1997 09:01:56 +0200 nipkow converse -> ^-1
Mon, 16 Jun 1997 14:25:33 +0200 paulson Type constraint added to ensure that "length" refers to lists. Maybe should
Mon, 16 Jun 1997 14:24:11 +0200 paulson Replacing the primrec definition of "length" by a translation to the built-in
Fri, 13 Jun 1997 10:35:13 +0200 nipkow Tuned wf_iff_no_infinite_down_chain proof, based on Konrads ideas.
Fri, 13 Jun 1997 10:04:37 +0200 mueller changed compatible definition;
Thu, 12 Jun 1997 16:48:03 +0200 mueller added deadlock
Thu, 12 Jun 1997 16:47:15 +0200 mueller added deadlock freedom, polished definitions and proofs
Mon, 09 Jun 1997 10:21:38 +0200 paulson Strengthened and streamlined the Yahalom proofs
Mon, 09 Jun 1997 10:21:05 +0200 paulson Useful new lemma
Fri, 06 Jun 1997 21:49:47 +0200 wenzelm eliminated non-ASCII;
Fri, 06 Jun 1997 19:30:06 +0200 nipkow Added
Fri, 06 Jun 1997 16:02:13 +0200 oheimb improved function 'nonreserved'
Fri, 06 Jun 1997 13:28:40 +0200 paulson Removed a few redundant additions of simprules or classical rules
Fri, 06 Jun 1997 13:26:41 +0200 paulson The name bex_conj_distrib was WRONG
Fri, 06 Jun 1997 12:48:21 +0200 paulson Better miniscoping for bounded quantifiers
Fri, 06 Jun 1997 10:47:16 +0200 paulson Tidying and simplification of declarations
Fri, 06 Jun 1997 10:46:26 +0200 paulson Much polishing of proofs
Fri, 06 Jun 1997 10:22:13 +0200 paulson New miniscoping rules for ALL
Fri, 06 Jun 1997 10:21:10 +0200 paulson New facts about In0/1 by Burkhart Wolff
Fri, 06 Jun 1997 10:20:38 +0200 paulson New miniscoping rules ball_triv and bex_triv
Fri, 06 Jun 1997 10:19:53 +0200 paulson Mended the definition of ack(0,n)
Fri, 06 Jun 1997 10:19:20 +0200 paulson Two new examples; corrected a comment
Fri, 06 Jun 1997 10:18:46 +0200 paulson New example theory: Recdef
Thu, 05 Jun 1997 19:44:13 +0200 nipkow added finite_converse
Thu, 05 Jun 1997 17:19:05 +0200 nipkow Moved image_is_empty from Finite.ML to equalities.ML
Thu, 05 Jun 1997 14:40:35 +0200 nipkow Modified a few defs and proofs because of the changes to theory Finite.thy.
Thu, 05 Jun 1997 14:39:22 +0200 nipkow Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
Thu, 05 Jun 1997 14:06:23 +0200 paulson New recdef examples
Thu, 05 Jun 1997 13:55:29 +0200 paulson Removal of freeze_vars and thaw_vars. New freeze_thaw
Thu, 05 Jun 1997 13:53:59 +0200 paulson freezeT now refers to Type.freeze_thaw
Thu, 05 Jun 1997 13:52:43 +0200 paulson Tidying of signature. More robust renaming in freeze_thaw.
Thu, 05 Jun 1997 13:30:24 +0200 paulson Removal of freeze_vars and thaw_vars (quite unused...)
Thu, 05 Jun 1997 13:29:41 +0200 paulson Removal of radixstring from string_of_int; addition of string_of_indexname
Thu, 05 Jun 1997 13:28:32 +0200 paulson There was never need for another copy of radixstring...
Thu, 05 Jun 1997 13:27:28 +0200 paulson Numerous simplifications and removal of HOL-isms
Thu, 05 Jun 1997 13:26:09 +0200 paulson Now loads theory Recdef
Thu, 05 Jun 1997 13:22:25 +0200 paulson A slight simplification of optstring
Thu, 05 Jun 1997 13:21:41 +0200 paulson Now extracts the predicate variable from induct0 insteead of trying to
Thu, 05 Jun 1997 13:20:18 +0200 paulson Deleted the obsolete "pred_list" relation
Thu, 05 Jun 1997 13:19:27 +0200 paulson Documented the new distinct_subgoals_tac
Thu, 05 Jun 1997 13:16:12 +0200 paulson A slight simplification of optstring
Thu, 05 Jun 1997 13:15:36 +0200 paulson Now extracts the predicate variable from induct0 insteead of trying to
Thu, 05 Jun 1997 13:14:52 +0200 paulson Made the pseudo-type of split_rule_var a separate argument
Wed, 04 Jun 1997 16:03:54 +0200 wenzelm eliminated non-ASCII;
Wed, 04 Jun 1997 12:26:42 +0200 wenzelm eliminated freeze_vars;
Wed, 04 Jun 1997 10:58:56 +0200 mueller changed priority of -> from [6,5]5 to [1,0]0
Tue, 03 Jun 1997 16:38:58 +0200 wenzelm is_blank: fixed space2;
Tue, 03 Jun 1997 12:03:38 +0200 paulson No longer refers to internal TFL structures
Tue, 03 Jun 1997 11:08:08 +0200 paulson More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
Tue, 03 Jun 1997 10:56:04 +0200 paulson New theory "Power" of exponentiation (and binomial coefficients)
Tue, 03 Jun 1997 10:53:58 +0200 paulson New theorem about the cardinality of the powerset (uses exponentiation)
Mon, 02 Jun 1997 12:19:01 +0200 paulson Type inference makes a Const here, perhaps elsewhere?thry.sml
Mon, 02 Jun 1997 12:17:19 +0200 paulson poly_tvars allows recdefs to be made without type constraints
Mon, 02 Jun 1997 12:16:24 +0200 paulson Corrected banner: it is W0, not MiniML
Mon, 02 Jun 1997 12:15:13 +0200 paulson New statement and proof of free_tv_subst_var in order to cope with new
Mon, 02 Jun 1997 12:14:15 +0200 paulson Now Un_insert_left, Un_insert_right are default rewrite rules
Mon, 02 Jun 1997 12:13:42 +0200 paulson Corrected statement of filter_append; added filter_size
Mon, 02 Jun 1997 12:12:57 +0200 paulson Simplified proof
Mon, 02 Jun 1997 12:12:27 +0200 paulson New theorems le_add_diff_inverse, le_add_diff_inverse2
Fri, 30 May 1997 16:37:20 +0200 mueller trivial changes to incorporate CTL.thy and Example.ML in html file;
Fri, 30 May 1997 15:55:27 +0200 paulson Simplified the calling sequence of CONTEXT_REWRITE_RULE
Fri, 30 May 1997 15:30:52 +0200 paulson Moved "less_eq" to NatDef from Arith
Fri, 30 May 1997 15:24:27 +0200 paulson New results including the basis for unique factorization
Fri, 30 May 1997 15:23:49 +0200 paulson Now "primes" is a set
Fri, 30 May 1997 15:23:25 +0200 paulson Now Divides must be the parent
Fri, 30 May 1997 15:22:19 +0200 paulson New proofs about cardinality. Suggested by Florian Kammueller
Fri, 30 May 1997 15:21:53 +0200 paulson Addition of Finite as parent allows cardinality theorems
Fri, 30 May 1997 15:21:21 +0200 paulson Replacement of "divides" by "dvd" from Divides.thy, and updating of proofs
Fri, 30 May 1997 15:20:41 +0200 paulson Overloading of "^" requires a type constraint
Fri, 30 May 1997 15:19:58 +0200 paulson Overloading of "^" requires new type class "power", with types "nat" and
Fri, 30 May 1997 15:17:36 +0200 paulson New theory Divides
Fri, 30 May 1997 15:17:14 +0200 paulson Many new theorems about cardinality
Fri, 30 May 1997 15:16:44 +0200 paulson Now Divides must be the parent
Fri, 30 May 1997 15:15:57 +0200 paulson Moving div and mod from Arith to Divides
Fri, 30 May 1997 15:14:59 +0200 paulson flushOut ensures that no recent error message are lost (not certain this is
Tue, 27 May 1997 17:49:52 +0200 wenzelm polyml-3.1 default again (for local work);
Tue, 27 May 1997 16:31:26 +0200 wenzelm fixed -P (checkout only);
Tue, 27 May 1997 15:45:07 +0200 wenzelm NJ 1.09.2x as factory default! Isabelle94-8
Tue, 27 May 1997 15:07:02 +0200 mueller Last changes for new release 94-8
Tue, 27 May 1997 14:38:49 +0200 wenzelm added 1.09.28 note;
Tue, 27 May 1997 13:26:42 +0200 paulson New theorems suggested by Florian Kammueller
Tue, 27 May 1997 13:26:11 +0200 paulson Restoration of the two "bypassed" theorems Union_quotient and quotient_disj
Tue, 27 May 1997 13:25:00 +0200 paulson Removal of card_insert_disjoint, which is now a default rewrite rule
Tue, 27 May 1997 13:24:15 +0200 paulson New theorem disjoint_eq_subset_Compl
Tue, 27 May 1997 13:23:53 +0200 paulson New theorem le_Suc_eq
Tue, 27 May 1997 13:23:27 +0200 paulson Removal of mask.sig and mask.sml
Tue, 27 May 1997 13:22:30 +0200 paulson Removal of module Mask and datatype binding with its constructor |->
Tue, 27 May 1997 13:03:41 +0200 paulson New theorems suggested by Florian Kammueller
Mon, 26 May 1997 14:54:24 +0200 slotosch remoded ccc1
Mon, 26 May 1997 13:51:03 +0200 slotosch removed ccc1
Mon, 26 May 1997 13:45:39 +0200 wenzelm tuned comment;
Mon, 26 May 1997 12:54:40 +0200 paulson Two useful facts about Powersets suggested by Florian Kammueller
Mon, 26 May 1997 12:53:45 +0200 paulson Added a missing "result();" after problem 43.
Mon, 26 May 1997 12:44:04 +0200 paulson Tidying using the new exhaust_tac
Mon, 26 May 1997 12:42:38 +0200 paulson Now recdef checks the name of the function being defined.
Mon, 26 May 1997 12:40:51 +0200 paulson Deleted option_case_tac because exhaust_tac performs a similar function.
Mon, 26 May 1997 12:39:57 +0200 paulson Renamed lessD to Suc_leI
Mon, 26 May 1997 12:38:29 +0200 paulson New operator "lists" for formalizing sets of lists
Mon, 26 May 1997 12:37:24 +0200 paulson New theorem subset_inj_onto
Mon, 26 May 1997 12:36:56 +0200 paulson Two results suggested by Florian Kammueller
Mon, 26 May 1997 12:36:16 +0200 paulson Tidying and a couple of useful lemmas
Mon, 26 May 1997 12:34:54 +0200 paulson Added recdef
Mon, 26 May 1997 12:34:05 +0200 paulson Primrec: New example ported from ZF
Mon, 26 May 1997 12:33:38 +0200 paulson Renamed lessD to Suc_leI
Mon, 26 May 1997 12:33:03 +0200 paulson New example ported from ZF
Mon, 26 May 1997 12:32:35 +0200 paulson Simplified proofs using expand_option_case
Mon, 26 May 1997 12:29:55 +0200 paulson Now checks the name of the function being defined;
Mon, 26 May 1997 12:29:10 +0200 paulson More de-HOL-ification
Mon, 26 May 1997 12:28:30 +0200 paulson Now checks the name of the function being defined
Mon, 26 May 1997 12:27:58 +0200 paulson Deleted unused functions
Mon, 26 May 1997 12:26:35 +0200 paulson Now a Perl script. No longer requires commands to be at the beginnings of
(0) -3000 -1000 -120 +120 +1000 +3000 +10000 +30000 tip