wenzelm [Sun, 25 Jun 2000 23:45:26 +0200] rev 9118
added change: 'a ref -> ('a -> 'a) -> unit;
berghofe [Fri, 23 Jun 2000 14:00:43 +0200] rev 9117
Added new theory Lambda/Type.
berghofe [Fri, 23 Jun 2000 12:29:55 +0200] rev 9116
get_inductive now returns None instead of raising an exception.
berghofe [Fri, 23 Jun 2000 12:28:09 +0200] rev 9115
Added new theory.
berghofe [Fri, 23 Jun 2000 12:24:37 +0200] rev 9114
Subject reduction and strong normalization of simply-typed lambda terms.
paulson [Fri, 23 Jun 2000 10:43:43 +0200] rev 9113
new theorem trans_O_subset
paulson [Fri, 23 Jun 2000 10:34:51 +0200] rev 9112
added the AllocImpl example
paulson [Fri, 23 Jun 2000 10:34:31 +0200] rev 9111
genPrefix_trans_O: generalizes genPrefix_trans
paulson [Fri, 23 Jun 2000 10:33:46 +0200] rev 9110
added the allocator refinement proof
paulson [Fri, 23 Jun 2000 10:33:11 +0200] rev 9109
sum_below f n -> setsum f (lessThan n)
wenzelm [Thu, 22 Jun 2000 23:04:34 +0200] rev 9108
bind_thm(s);
paulson [Thu, 22 Jun 2000 11:37:13 +0200] rev 9107
removed some finiteness conditions from bag_of/sublist theorems
paulson [Thu, 22 Jun 2000 11:36:08 +0200] rev 9106
working proofs of the basic merge and distributor properties
paulson [Thu, 22 Jun 2000 11:35:28 +0200] rev 9105
fixed the merge spec (NbT -> Nclients) and added the distributor spec
paulson [Thu, 22 Jun 2000 11:34:48 +0200] rev 9104
new thoerem Always_Follows2; renamed Always_Follows -> Always_Follows1
wenzelm [Wed, 21 Jun 2000 20:38:25 +0200] rev 9103
added with_paths;
wenzelm [Wed, 21 Jun 2000 18:14:28 +0200] rev 9102
fixed deps;
wenzelm [Wed, 21 Jun 2000 18:09:09 +0200] rev 9101
fixed deps;
wenzelm [Wed, 21 Jun 2000 15:58:23 +0200] rev 9100
fixed deps;
paulson [Wed, 21 Jun 2000 10:34:33 +0200] rev 9099
new theorems lepoll_Ord_imp_eqpoll, lesspoll_imp_eqpoll, lesspoll_nat_is_Finite
paulson [Wed, 21 Jun 2000 10:32:57 +0200] rev 9098
new theorem UN_empty; it and Un_empty inserted by AddIffs
paulson [Wed, 21 Jun 2000 10:31:34 +0200] rev 9097
generalized {Domain,Range}_partial_func to {Domain,Range}_Collect_split
paulson [Wed, 21 Jun 2000 10:30:36 +0200] rev 9096
tidied; weakened the (impossible) premises of setsum_UN_disjoint
paulson [Tue, 20 Jun 2000 11:54:22 +0200] rev 9095
new module for heaps
paulson [Tue, 20 Jun 2000 11:54:07 +0200] rev 9094
now uses the heap data structure for BEST_FIRST
paulson [Tue, 20 Jun 2000 11:53:35 +0200] rev 9093
new file heap.ML
paulson [Tue, 20 Jun 2000 11:53:16 +0200] rev 9092
changed the Schubert Steamroller proof
paulson [Tue, 20 Jun 2000 11:52:38 +0200] rev 9091
another brick in the wall
paulson [Tue, 20 Jun 2000 11:51:21 +0200] rev 9090
changed a step for the improved rules for setsum
paulson [Tue, 20 Jun 2000 11:50:33 +0200] rev 9089
deleted a step made redundant by the improved rules for setsum
paulson [Tue, 20 Jun 2000 11:42:24 +0200] rev 9088
replaced the useless [p]subset_insertD by [p]subset_insert_iff
paulson [Tue, 20 Jun 2000 11:41:25 +0200] rev 9087
now setsum f A = 0 unless A is finite
paulson [Tue, 20 Jun 2000 11:41:07 +0200] rev 9086
now setsum f A = 0 unless A is finite; proved setsum_cong
paulson [Fri, 16 Jun 2000 14:02:41 +0200] rev 9085
real simprocs
paulson [Fri, 16 Jun 2000 13:41:44 +0200] rev 9084
fixed for removal of subset_empty
paulson [Fri, 16 Jun 2000 13:39:21 +0200] rev 9083
this proof needs more detail
paulson [Fri, 16 Jun 2000 13:33:39 +0200] rev 9082
uncommented the last 2 examples; tidied
paulson [Fri, 16 Jun 2000 13:32:59 +0200] rev 9081
new lemma real_minus_diff_eq
paulson [Fri, 16 Jun 2000 13:28:26 +0200] rev 9080
fixed the installation of linear arithmetic for the reals
paulson [Fri, 16 Jun 2000 13:21:17 +0200] rev 9079
some missing simprules for integer linear arithmetic
paulson [Fri, 16 Jun 2000 13:19:15 +0200] rev 9078
tidied for new card_seteq
paulson [Fri, 16 Jun 2000 13:18:55 +0200] rev 9077
subset_empty is no longer a simprule
paulson [Fri, 16 Jun 2000 13:16:07 +0200] rev 9076
renamed psubset_card -> psubset_card_mono
paulson [Fri, 16 Jun 2000 13:15:40 +0200] rev 9075
Finally "AddEs [equalityE]" is IN and "AddDs [equals0D, sym RS equals0D]" is OUT
paulson [Fri, 16 Jun 2000 13:15:04 +0200] rev 9074
inserted some "addsimps [subset_empty]"; also tidied (a lot)
paulson [Fri, 16 Jun 2000 13:13:55 +0200] rev 9073
tracing flag for arith_tac
berghofe [Thu, 15 Jun 2000 16:02:12 +0200] rev 9072
Now also proves monotonicity when in quick_and_dirty mode.
paulson [Wed, 14 Jun 2000 18:24:41 +0200] rev 9071
tidied
paulson [Wed, 14 Jun 2000 18:23:51 +0200] rev 9070
full_rename_numerals -> rename_numerals; tidied
paulson [Wed, 14 Jun 2000 18:21:25 +0200] rev 9069
a big tidy-up
paulson [Wed, 14 Jun 2000 18:19:20 +0200] rev 9068
installing the cancel_numerals and combine_numerals simprocs
wenzelm [Wed, 14 Jun 2000 18:00:46 +0200] rev 9067
tuned tappl syntax;
wenzelm [Wed, 14 Jun 2000 17:59:53 +0200] rev 9066
theorems [cases type: bool] = case_split;
paulson [Wed, 14 Jun 2000 17:47:18 +0200] rev 9065
full_rename_numerals -> rename_numerals; tidied
paulson [Wed, 14 Jun 2000 17:46:10 +0200] rev 9064
tidied a proof using new lemmas for signs of products
paulson [Wed, 14 Jun 2000 17:45:01 +0200] rev 9063
new lemmas for signs of products
paulson [Wed, 14 Jun 2000 17:44:43 +0200] rev 9062
new default simprules for m*n = 0
wenzelm [Tue, 13 Jun 2000 18:36:06 +0200] rev 9061
tuned;
wenzelm [Tue, 13 Jun 2000 18:34:59 +0200] rev 9060
rename @case to _case_syntax (improves on low-level errors);
wenzelm [Tue, 13 Jun 2000 18:33:55 +0200] rev 9059
updated;