Tue, 03 Jun 1997 16:38:58 +0200 is_blank: fixed space2;
wenzelm [Tue, 03 Jun 1997 16:38:58 +0200] rev 3393
is_blank: fixed space2;
Tue, 03 Jun 1997 12:03:38 +0200 No longer refers to internal TFL structures
paulson [Tue, 03 Jun 1997 12:03:38 +0200] rev 3392
No longer refers to internal TFL structures
Tue, 03 Jun 1997 11:08:08 +0200 More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
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)
Tue, 03 Jun 1997 10:56:04 +0200 New theory "Power" of exponentiation (and binomial coefficients)
paulson [Tue, 03 Jun 1997 10:56:04 +0200] rev 3390
New theory "Power" of exponentiation (and binomial coefficients)
Tue, 03 Jun 1997 10:53:58 +0200 New theorem about the cardinality of the powerset (uses exponentiation)
paulson [Tue, 03 Jun 1997 10:53:58 +0200] rev 3389
New theorem about the cardinality of the powerset (uses exponentiation)
Mon, 02 Jun 1997 12:19:01 +0200 Type inference makes a Const here, perhaps elsewhere?thry.sml
paulson [Mon, 02 Jun 1997 12:19:01 +0200] rev 3388
Type inference makes a Const here, perhaps elsewhere?thry.sml
Mon, 02 Jun 1997 12:17:19 +0200 poly_tvars allows recdefs to be made without type constraints
paulson [Mon, 02 Jun 1997 12:17:19 +0200] rev 3387
poly_tvars allows recdefs to be made without type constraints
Mon, 02 Jun 1997 12:16:24 +0200 Corrected banner: it is W0, not MiniML
paulson [Mon, 02 Jun 1997 12:16:24 +0200] rev 3386
Corrected banner: it is W0, not MiniML
Mon, 02 Jun 1997 12:15:13 +0200 New statement and proof of free_tv_subst_var in order to cope with new
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
Mon, 02 Jun 1997 12:14:15 +0200 Now Un_insert_left, Un_insert_right are default rewrite rules
paulson [Mon, 02 Jun 1997 12:14:15 +0200] rev 3384
Now Un_insert_left, Un_insert_right are default rewrite rules
Mon, 02 Jun 1997 12:13:42 +0200 Corrected statement of filter_append; added filter_size
paulson [Mon, 02 Jun 1997 12:13:42 +0200] rev 3383
Corrected statement of filter_append; added filter_size
Mon, 02 Jun 1997 12:12:57 +0200 Simplified proof
paulson [Mon, 02 Jun 1997 12:12:57 +0200] rev 3382
Simplified proof
Mon, 02 Jun 1997 12:12:27 +0200 New theorems le_add_diff_inverse, le_add_diff_inverse2
paulson [Mon, 02 Jun 1997 12:12:27 +0200] rev 3381
New theorems le_add_diff_inverse, le_add_diff_inverse2
Fri, 30 May 1997 16:37:20 +0200 trivial changes to incorporate CTL.thy and Example.ML in html file;
mueller [Fri, 30 May 1997 16:37:20 +0200] rev 3380
trivial changes to incorporate CTL.thy and Example.ML in html file;
Fri, 30 May 1997 15:55:27 +0200 Simplified the calling sequence of CONTEXT_REWRITE_RULE
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
Fri, 30 May 1997 15:30:52 +0200 Moved "less_eq" to NatDef from Arith
paulson [Fri, 30 May 1997 15:30:52 +0200] rev 3378
Moved "less_eq" to NatDef from Arith
Fri, 30 May 1997 15:24:27 +0200 New results including the basis for unique factorization
paulson [Fri, 30 May 1997 15:24:27 +0200] rev 3377
New results including the basis for unique factorization
Fri, 30 May 1997 15:23:49 +0200 Now "primes" is a set
paulson [Fri, 30 May 1997 15:23:49 +0200] rev 3376
Now "primes" is a set
Fri, 30 May 1997 15:23:25 +0200 Now Divides must be the parent
paulson [Fri, 30 May 1997 15:23:25 +0200] rev 3375
Now Divides must be the parent
Fri, 30 May 1997 15:22:19 +0200 New proofs about cardinality. Suggested by Florian Kammueller
paulson [Fri, 30 May 1997 15:22:19 +0200] rev 3374
New proofs about cardinality. Suggested by Florian Kammueller
Fri, 30 May 1997 15:21:53 +0200 Addition of Finite as parent allows cardinality theorems
paulson [Fri, 30 May 1997 15:21:53 +0200] rev 3373
Addition of Finite as parent allows cardinality theorems
Fri, 30 May 1997 15:21:21 +0200 Replacement of "divides" by "dvd" from Divides.thy, and updating of proofs
paulson [Fri, 30 May 1997 15:21:21 +0200] rev 3372
Replacement of "divides" by "dvd" from Divides.thy, and updating of proofs
Fri, 30 May 1997 15:20:41 +0200 Overloading of "^" requires a type constraint
paulson [Fri, 30 May 1997 15:20:41 +0200] rev 3371
Overloading of "^" requires a type constraint
Fri, 30 May 1997 15:19:58 +0200 Overloading of "^" requires new type class "power", with types "nat" and
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
(0) -3000 -1000 -300 -100 -50 -24 +24 +50 +100 +300 +1000 +3000 +10000 +30000 tip