Sat, 01 May 2010 11:46:47 -0700 complete_lattice instance for net type
huffman [Sat, 01 May 2010 11:46:47 -0700] rev 36630
complete_lattice instance for net type
Sat, 01 May 2010 09:43:40 -0700 swap ordering on nets, so x <= y means 'x is finer than y'
huffman [Sat, 01 May 2010 09:43:40 -0700] rev 36629
swap ordering on nets, so x <= y means 'x is finer than y'
Sat, 01 May 2010 07:53:42 -0700 fixrec no longer uses global simpset internally to prove equations
huffman [Sat, 01 May 2010 07:53:42 -0700] rev 36628
fixrec no longer uses global simpset internally to prove equations
Sat, 01 May 2010 07:35:22 -0700 move setsum lemmas to Product_plus.thy
huffman [Sat, 01 May 2010 07:35:22 -0700] rev 36627
move setsum lemmas to Product_plus.thy
Fri, 30 Apr 2010 13:51:17 -0700 remove duplicate lemmas
huffman [Fri, 30 Apr 2010 13:51:17 -0700] rev 36626
remove duplicate lemmas
Fri, 30 Apr 2010 13:31:32 -0700 add lemmas about convergent
huffman [Fri, 30 Apr 2010 13:31:32 -0700] rev 36625
add lemmas about convergent
Mon, 03 May 2010 14:35:10 +0200 Cleanup information theory
hoelzl [Mon, 03 May 2010 14:35:10 +0200] rev 36624
Cleanup information theory
Mon, 03 May 2010 14:35:10 +0200 Moved Convex theory to library.
hoelzl [Mon, 03 May 2010 14:35:10 +0200] rev 36623
Moved Convex theory to library.
Tue, 20 Apr 2010 17:58:34 +0200 Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
hoelzl [Tue, 20 Apr 2010 17:58:34 +0200] rev 36622
Generalize swap_inj_on; add simps for Times; add Ex_list_of_length, log_inj; Added missing locale edges for linordered semiring with 1.
Tue, 04 May 2010 14:38:59 +0200 proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences:
wenzelm [Tue, 04 May 2010 14:38:59 +0200] rev 36621
proof terms for strip_shyps, based on the version by krauss/schropp with some notable differences: * present type variables are only compared wrt. first component (the atomic type), not the duplicated sort; * extra sorts are grounded towards fixed 'a, potentially with different sorts (the original version with Name.names could cause name clashes with other present variables, too, but this should not be a problem); * deriv_rule_unconditional ensures that proof terms are always maintained independently of the "proofs" flag -- this improves robustness and preserves basic PThm proofs required for extraction attributes, e.g. in theory HOL/Extraction;
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip