mueller [Fri, 13 Jun 1997 10:04:37 +0200] rev 3435
changed compatible definition;
mueller [Thu, 12 Jun 1997 16:48:03 +0200] rev 3434
added deadlock
mueller [Thu, 12 Jun 1997 16:47:15 +0200] rev 3433
added deadlock freedom, polished definitions and proofs
paulson [Mon, 09 Jun 1997 10:21:38 +0200] rev 3432
Strengthened and streamlined the Yahalom proofs
paulson [Mon, 09 Jun 1997 10:21:05 +0200] rev 3431
Useful new lemma
wenzelm [Fri, 06 Jun 1997 21:49:47 +0200] rev 3430
eliminated non-ASCII;
nipkow [Fri, 06 Jun 1997 19:30:06 +0200] rev 3429
Added
AddIffs [Pair_eq];
which made
AddSEs [Pair_inject];
redundant.
oheimb [Fri, 06 Jun 1997 16:02:13 +0200] rev 3428
improved function 'nonreserved'
paulson [Fri, 06 Jun 1997 13:28:40 +0200] rev 3427
Removed a few redundant additions of simprules or classical rules
paulson [Fri, 06 Jun 1997 13:26:41 +0200] rev 3426
The name bex_conj_distrib was WRONG
paulson [Fri, 06 Jun 1997 12:48:21 +0200] rev 3425
Better miniscoping for bounded quantifiers
paulson [Fri, 06 Jun 1997 10:47:16 +0200] rev 3424
Tidying and simplification of declarations
paulson [Fri, 06 Jun 1997 10:46:26 +0200] rev 3423
Much polishing of proofs
paulson [Fri, 06 Jun 1997 10:22:13 +0200] rev 3422
New miniscoping rules for ALL
paulson [Fri, 06 Jun 1997 10:21:10 +0200] rev 3421
New facts about In0/1 by Burkhart Wolff
paulson [Fri, 06 Jun 1997 10:20:38 +0200] rev 3420
New miniscoping rules ball_triv and bex_triv
paulson [Fri, 06 Jun 1997 10:19:53 +0200] rev 3419
Mended the definition of ack(0,n)
paulson [Fri, 06 Jun 1997 10:19:20 +0200] rev 3418
Two new examples; corrected a comment
paulson [Fri, 06 Jun 1997 10:18:46 +0200] rev 3417
New example theory: Recdef
nipkow [Thu, 05 Jun 1997 19:44:13 +0200] rev 3416
added finite_converse
nipkow [Thu, 05 Jun 1997 17:19:05 +0200] rev 3415
Moved image_is_empty from Finite.ML to equalities.ML
nipkow [Thu, 05 Jun 1997 14:40:35 +0200] rev 3414
Modified a few defs and proofs because of the changes to theory Finite.thy.
nipkow [Thu, 05 Jun 1997 14:39:22 +0200] rev 3413
Finite.ML Finite.thy: Replaced `finite subset of' by mere `finite'.
Relation.ML Trancl.ML: more thms
WF.ML WF.thy: added `acyclic'
WF_Rel.ML: moved some thms back into WF and added some new ones.
paulson [Thu, 05 Jun 1997 14:06:23 +0200] rev 3412
New recdef examples
paulson [Thu, 05 Jun 1997 13:55:29 +0200] rev 3411
Removal of freeze_vars and thaw_vars. New freeze_thaw
paulson [Thu, 05 Jun 1997 13:53:59 +0200] rev 3410
freezeT now refers to Type.freeze_thaw
paulson [Thu, 05 Jun 1997 13:52:43 +0200] rev 3409
Tidying of signature. More robust renaming in freeze_thaw.
New tactic distinct_subgoals_tac
paulson [Thu, 05 Jun 1997 13:30:24 +0200] rev 3408
Removal of freeze_vars and thaw_vars (quite unused...)
paulson [Thu, 05 Jun 1997 13:29:41 +0200] rev 3407
Removal of radixstring from string_of_int; addition of string_of_indexname
paulson [Thu, 05 Jun 1997 13:28:32 +0200] rev 3406
There was never need for another copy of radixstring...
paulson [Thu, 05 Jun 1997 13:27:28 +0200] rev 3405
Numerous simplifications and removal of HOL-isms
Addition of the "simpset" feature (replacing references to \!simpset)
paulson [Thu, 05 Jun 1997 13:26:09 +0200] rev 3404
Now loads theory Recdef
paulson [Thu, 05 Jun 1997 13:22:25 +0200] rev 3403
A slight simplification of optstring
The new "simpset" keyword in the "recdef" declaration
paulson [Thu, 05 Jun 1997 13:21:41 +0200] rev 3402
Now extracts the predicate variable from induct0 insteead of trying to
predict its name. The new "freeze" function requires this.
paulson [Thu, 05 Jun 1997 13:20:18 +0200] rev 3401
Deleted the obsolete "pred_list" relation
paulson [Thu, 05 Jun 1997 13:19:27 +0200] rev 3400
Documented the new distinct_subgoals_tac
paulson [Thu, 05 Jun 1997 13:16:12 +0200] rev 3399
A slight simplification of optstring
paulson [Thu, 05 Jun 1997 13:15:36 +0200] rev 3398
Now extracts the predicate variable from induct0 insteead of trying to
predict its name
paulson [Thu, 05 Jun 1997 13:14:52 +0200] rev 3397
Made the pseudo-type of split_rule_var a separate argument
wenzelm [Wed, 04 Jun 1997 16:03:54 +0200] rev 3396
eliminated non-ASCII;
wenzelm [Wed, 04 Jun 1997 12:26:42 +0200] rev 3395
eliminated freeze_vars;
mueller [Wed, 04 Jun 1997 10:58:56 +0200] rev 3394
changed priority of -> from [6,5]5 to [1,0]0
wenzelm [Tue, 03 Jun 1997 16:38:58 +0200] rev 3393
is_blank: fixed space2;
paulson [Tue, 03 Jun 1997 12:03:38 +0200] rev 3392
No longer refers to internal TFL structures
paulson [Tue, 03 Jun 1997 11:08:08 +0200] rev 3391
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
Changed the TFL functor to a structure (currently called Prim)
paulson [Tue, 03 Jun 1997 10:56:04 +0200] rev 3390
New theory "Power" of exponentiation (and binomial coefficients)
paulson [Tue, 03 Jun 1997 10:53:58 +0200] rev 3389
New theorem about the cardinality of the powerset (uses exponentiation)
paulson [Mon, 02 Jun 1997 12:19:01 +0200] rev 3388
Type inference makes a Const here, perhaps elsewhere?thry.sml
paulson [Mon, 02 Jun 1997 12:17:19 +0200] rev 3387
poly_tvars allows recdefs to be made without type constraints
paulson [Mon, 02 Jun 1997 12:16:24 +0200] rev 3386
Corrected banner: it is W0, not MiniML
paulson [Mon, 02 Jun 1997 12:15:13 +0200] rev 3385
New statement and proof of free_tv_subst_var in order to cope with new
rewrite rules Un_insert_left, Un_insert_right
paulson [Mon, 02 Jun 1997 12:14:15 +0200] rev 3384
Now Un_insert_left, Un_insert_right are default rewrite rules
paulson [Mon, 02 Jun 1997 12:13:42 +0200] rev 3383
Corrected statement of filter_append; added filter_size
paulson [Mon, 02 Jun 1997 12:12:57 +0200] rev 3382
Simplified proof
paulson [Mon, 02 Jun 1997 12:12:27 +0200] rev 3381
New theorems le_add_diff_inverse, le_add_diff_inverse2
mueller [Fri, 30 May 1997 16:37:20 +0200] rev 3380
trivial changes to incorporate CTL.thy and Example.ML in html file;
paulson [Fri, 30 May 1997 15:55:27 +0200] rev 3379
Simplified the calling sequence of CONTEXT_REWRITE_RULE
Eliminated get_rhs, which was calling dest_Trueprop too many times
paulson [Fri, 30 May 1997 15:30:52 +0200] rev 3378
Moved "less_eq" to NatDef from Arith
paulson [Fri, 30 May 1997 15:24:27 +0200] rev 3377
New results including the basis for unique factorization
paulson [Fri, 30 May 1997 15:23:49 +0200] rev 3376
Now "primes" is a set
paulson [Fri, 30 May 1997 15:23:25 +0200] rev 3375
Now Divides must be the parent
paulson [Fri, 30 May 1997 15:22:19 +0200] rev 3374
New proofs about cardinality. Suggested by Florian Kammueller
paulson [Fri, 30 May 1997 15:21:53 +0200] rev 3373
Addition of Finite as parent allows cardinality theorems
paulson [Fri, 30 May 1997 15:21:21 +0200] rev 3372
Replacement of "divides" by "dvd" from Divides.thy, and updating of proofs
paulson [Fri, 30 May 1997 15:20:41 +0200] rev 3371
Overloading of "^" requires a type constraint
paulson [Fri, 30 May 1997 15:19:58 +0200] rev 3370
Overloading of "^" requires new type class "power", with types "nat" and
"set" in that class. The operator itself is declared in Nat.thy
paulson [Fri, 30 May 1997 15:17:36 +0200] rev 3369
New theory Divides
paulson [Fri, 30 May 1997 15:17:14 +0200] rev 3368
Many new theorems about cardinality
paulson [Fri, 30 May 1997 15:16:44 +0200] rev 3367
Now Divides must be the parent
paulson [Fri, 30 May 1997 15:15:57 +0200] rev 3366
Moving div and mod from Arith to Divides
Moving dvd from ex/Primes to Divides
paulson [Fri, 30 May 1997 15:14:59 +0200] rev 3365
flushOut ensures that no recent error message are lost (not certain this is
necessary)
wenzelm [Tue, 27 May 1997 17:49:52 +0200] rev 3364
polyml-3.1 default again (for local work);
wenzelm [Tue, 27 May 1997 16:31:26 +0200] rev 3363
fixed -P (checkout only);
wenzelm [Tue, 27 May 1997 15:45:07 +0200] rev 3362
NJ 1.09.2x as factory default!
mueller [Tue, 27 May 1997 15:07:02 +0200] rev 3361
Last changes for new release 94-8
wenzelm [Tue, 27 May 1997 14:38:49 +0200] rev 3360
added 1.09.28 note;
paulson [Tue, 27 May 1997 13:26:42 +0200] rev 3359
New theorems suggested by Florian Kammueller
paulson [Tue, 27 May 1997 13:26:11 +0200] rev 3358
Restoration of the two "bypassed" theorems Union_quotient and quotient_disj
paulson [Tue, 27 May 1997 13:25:00 +0200] rev 3357
Removal of card_insert_disjoint, which is now a default rewrite rule
paulson [Tue, 27 May 1997 13:24:15 +0200] rev 3356
New theorem disjoint_eq_subset_Compl
paulson [Tue, 27 May 1997 13:23:53 +0200] rev 3355
New theorem le_Suc_eq
paulson [Tue, 27 May 1997 13:23:27 +0200] rev 3354
Removal of mask.sig and mask.sml
paulson [Tue, 27 May 1997 13:22:30 +0200] rev 3353
Removal of module Mask and datatype binding with its constructor |->
paulson [Tue, 27 May 1997 13:03:41 +0200] rev 3352
New theorems suggested by Florian Kammueller
slotosch [Mon, 26 May 1997 14:54:24 +0200] rev 3351
remoded ccc1
slotosch [Mon, 26 May 1997 13:51:03 +0200] rev 3350
removed ccc1
wenzelm [Mon, 26 May 1997 13:45:39 +0200] rev 3349
tuned comment;
paulson [Mon, 26 May 1997 12:54:40 +0200] rev 3348
Two useful facts about Powersets suggested by Florian Kammueller
paulson [Mon, 26 May 1997 12:53:45 +0200] rev 3347
Added a missing "result();" after problem 43.
paulson [Mon, 26 May 1997 12:44:04 +0200] rev 3346
Tidying using the new exhaust_tac
paulson [Mon, 26 May 1997 12:42:38 +0200] rev 3345
Now recdef checks the name of the function being defined.
Slight tidying
paulson [Mon, 26 May 1997 12:40:51 +0200] rev 3344
Deleted option_case_tac because exhaust_tac performs a similar function.
Deleted the duplicate proof of expand_option_case...
paulson [Mon, 26 May 1997 12:39:57 +0200] rev 3343
Renamed lessD to Suc_leI
paulson [Mon, 26 May 1997 12:38:29 +0200] rev 3342
New operator "lists" for formalizing sets of lists
paulson [Mon, 26 May 1997 12:37:24 +0200] rev 3341
New theorem subset_inj_onto
paulson [Mon, 26 May 1997 12:36:56 +0200] rev 3340
Two results suggested by Florian Kammueller