| Sun, 25 Jun 2000 23:46:22 +0200 |
wenzelm |
fbrk: 2 if not taken;
|
changeset |
files
|
| Sun, 25 Jun 2000 23:46:03 +0200 |
wenzelm |
export hidden: string -> string;
|
changeset |
files
|
| Sun, 25 Jun 2000 23:45:47 +0200 |
wenzelm |
tuned;
|
changeset |
files
|
| Sun, 25 Jun 2000 23:45:26 +0200 |
wenzelm |
added change: 'a ref -> ('a -> 'a) -> unit;
|
changeset |
files
|
| Fri, 23 Jun 2000 14:00:43 +0200 |
berghofe |
Added new theory Lambda/Type.
|
changeset |
files
|
| Fri, 23 Jun 2000 12:29:55 +0200 |
berghofe |
get_inductive now returns None instead of raising an exception.
|
changeset |
files
|
| Fri, 23 Jun 2000 12:28:09 +0200 |
berghofe |
Added new theory.
|
changeset |
files
|
| Fri, 23 Jun 2000 12:24:37 +0200 |
berghofe |
Subject reduction and strong normalization of simply-typed lambda terms.
|
changeset |
files
|
| Fri, 23 Jun 2000 10:43:43 +0200 |
paulson |
new theorem trans_O_subset
|
changeset |
files
|
| Fri, 23 Jun 2000 10:34:51 +0200 |
paulson |
added the AllocImpl example
|
changeset |
files
|
| Fri, 23 Jun 2000 10:34:31 +0200 |
paulson |
genPrefix_trans_O: generalizes genPrefix_trans
|
changeset |
files
|
| Fri, 23 Jun 2000 10:33:46 +0200 |
paulson |
added the allocator refinement proof
|
changeset |
files
|
| Fri, 23 Jun 2000 10:33:11 +0200 |
paulson |
sum_below f n -> setsum f (lessThan n)
|
changeset |
files
|
| Thu, 22 Jun 2000 23:04:34 +0200 |
wenzelm |
bind_thm(s);
|
changeset |
files
|
| Thu, 22 Jun 2000 11:37:13 +0200 |
paulson |
removed some finiteness conditions from bag_of/sublist theorems
|
changeset |
files
|
| Thu, 22 Jun 2000 11:36:08 +0200 |
paulson |
working proofs of the basic merge and distributor properties
|
changeset |
files
|
| Thu, 22 Jun 2000 11:35:28 +0200 |
paulson |
fixed the merge spec (NbT -> Nclients) and added the distributor spec
|
changeset |
files
|
| Thu, 22 Jun 2000 11:34:48 +0200 |
paulson |
new thoerem Always_Follows2; renamed Always_Follows -> Always_Follows1
|
changeset |
files
|
| Wed, 21 Jun 2000 20:38:25 +0200 |
wenzelm |
added with_paths;
|
changeset |
files
|
| Wed, 21 Jun 2000 18:14:28 +0200 |
wenzelm |
fixed deps;
|
changeset |
files
|
| Wed, 21 Jun 2000 18:09:09 +0200 |
wenzelm |
fixed deps;
|
changeset |
files
|
| Wed, 21 Jun 2000 15:58:23 +0200 |
wenzelm |
fixed deps;
|
changeset |
files
|
| Wed, 21 Jun 2000 10:34:33 +0200 |
paulson |
new theorems lepoll_Ord_imp_eqpoll, lesspoll_imp_eqpoll, lesspoll_nat_is_Finite
|
changeset |
files
|
| Wed, 21 Jun 2000 10:32:57 +0200 |
paulson |
new theorem UN_empty; it and Un_empty inserted by AddIffs
|
changeset |
files
|
| Wed, 21 Jun 2000 10:31:34 +0200 |
paulson |
generalized {Domain,Range}_partial_func to {Domain,Range}_Collect_split
|
changeset |
files
|
| Wed, 21 Jun 2000 10:30:36 +0200 |
paulson |
tidied; weakened the (impossible) premises of setsum_UN_disjoint
|
changeset |
files
|
| Tue, 20 Jun 2000 11:54:22 +0200 |
paulson |
new module for heaps
|
changeset |
files
|
| Tue, 20 Jun 2000 11:54:07 +0200 |
paulson |
now uses the heap data structure for BEST_FIRST
|
changeset |
files
|
| Tue, 20 Jun 2000 11:53:35 +0200 |
paulson |
new file heap.ML
|
changeset |
files
|
| Tue, 20 Jun 2000 11:53:16 +0200 |
paulson |
changed the Schubert Steamroller proof
|
changeset |
files
|
| Tue, 20 Jun 2000 11:52:38 +0200 |
paulson |
another brick in the wall
|
changeset |
files
|
| Tue, 20 Jun 2000 11:51:21 +0200 |
paulson |
changed a step for the improved rules for setsum
|
changeset |
files
|
| Tue, 20 Jun 2000 11:50:33 +0200 |
paulson |
deleted a step made redundant by the improved rules for setsum
|
changeset |
files
|
| Tue, 20 Jun 2000 11:42:24 +0200 |
paulson |
replaced the useless [p]subset_insertD by [p]subset_insert_iff
|
changeset |
files
|
| Tue, 20 Jun 2000 11:41:25 +0200 |
paulson |
now setsum f A = 0 unless A is finite
|
changeset |
files
|
| Tue, 20 Jun 2000 11:41:07 +0200 |
paulson |
now setsum f A = 0 unless A is finite; proved setsum_cong
|
changeset |
files
|
| Fri, 16 Jun 2000 14:02:41 +0200 |
paulson |
real simprocs
|
changeset |
files
|
| Fri, 16 Jun 2000 13:41:44 +0200 |
paulson |
fixed for removal of subset_empty
|
changeset |
files
|
| Fri, 16 Jun 2000 13:39:21 +0200 |
paulson |
this proof needs more detail
|
changeset |
files
|
| Fri, 16 Jun 2000 13:33:39 +0200 |
paulson |
uncommented the last 2 examples; tidied
|
changeset |
files
|
| Fri, 16 Jun 2000 13:32:59 +0200 |
paulson |
new lemma real_minus_diff_eq
|
changeset |
files
|
| Fri, 16 Jun 2000 13:28:26 +0200 |
paulson |
fixed the installation of linear arithmetic for the reals
|
changeset |
files
|
| Fri, 16 Jun 2000 13:21:17 +0200 |
paulson |
some missing simprules for integer linear arithmetic
|
changeset |
files
|
| Fri, 16 Jun 2000 13:19:15 +0200 |
paulson |
tidied for new card_seteq
|
changeset |
files
|
| Fri, 16 Jun 2000 13:18:55 +0200 |
paulson |
subset_empty is no longer a simprule
|
changeset |
files
|
| Fri, 16 Jun 2000 13:16:07 +0200 |
paulson |
renamed psubset_card -> psubset_card_mono
|
changeset |
files
|
| Fri, 16 Jun 2000 13:15:40 +0200 |
paulson |
Finally "AddEs [equalityE]" is IN and "AddDs [equals0D, sym RS equals0D]" is OUT
|
changeset |
files
|
| Fri, 16 Jun 2000 13:15:04 +0200 |
paulson |
inserted some "addsimps [subset_empty]"; also tidied (a lot)
|
changeset |
files
|
| Fri, 16 Jun 2000 13:13:55 +0200 |
paulson |
tracing flag for arith_tac
|
changeset |
files
|
| Thu, 15 Jun 2000 16:02:12 +0200 |
berghofe |
Now also proves monotonicity when in quick_and_dirty mode.
|
changeset |
files
|
| Wed, 14 Jun 2000 18:24:41 +0200 |
paulson |
tidied
|
changeset |
files
|
| Wed, 14 Jun 2000 18:23:51 +0200 |
paulson |
full_rename_numerals -> rename_numerals; tidied
|
changeset |
files
|
| Wed, 14 Jun 2000 18:21:25 +0200 |
paulson |
a big tidy-up
|
changeset |
files
|
| Wed, 14 Jun 2000 18:19:20 +0200 |
paulson |
installing the cancel_numerals and combine_numerals simprocs
|
changeset |
files
|
| Wed, 14 Jun 2000 18:00:46 +0200 |
wenzelm |
tuned tappl syntax;
|
changeset |
files
|
| Wed, 14 Jun 2000 17:59:53 +0200 |
wenzelm |
theorems [cases type: bool] = case_split;
|
changeset |
files
|
| Wed, 14 Jun 2000 17:47:18 +0200 |
paulson |
full_rename_numerals -> rename_numerals; tidied
|
changeset |
files
|
| Wed, 14 Jun 2000 17:46:10 +0200 |
paulson |
tidied a proof using new lemmas for signs of products
|
changeset |
files
|
| Wed, 14 Jun 2000 17:45:01 +0200 |
paulson |
new lemmas for signs of products
|
changeset |
files
|
| Wed, 14 Jun 2000 17:44:43 +0200 |
paulson |
new default simprules for m*n = 0
|
changeset |
files
|