src/HOL/Library/RBT_Set.thy
Mon, 12 Jul 2021 11:41:02 +0000 haftmann proper local context
Tue, 01 Jun 2021 19:46:34 +0200 nipkow More general fold function for maps
Tue, 18 May 2021 20:25:08 +0100 paulson sorted as an abbreviation
Tue, 08 May 2018 10:14:36 +0200 nipkow new def of sorted and sorted_wrt
Tue, 20 Feb 2018 22:25:23 +0100 wenzelm tuned proofs -- prefer explicit names for facts from 'interpret';
Fri, 12 Jan 2018 15:27:46 +0100 wenzelm prefer formal comments;
Wed, 10 Jan 2018 15:25:09 +0100 nipkow ran isabelle update_op on all sources
Sun, 26 Nov 2017 21:08:32 +0100 wenzelm more symbols;
Sat, 12 Aug 2017 08:56:25 +0200 haftmann code generation for Gcd and Lcm when sets are implemented by red-black trees
Tue, 20 Jun 2017 13:07:47 +0200 haftmann avoid ancient [code, code del] antipattern
Mon, 17 Oct 2016 17:33:07 +0200 nipkow setprod -> prod
Mon, 17 Oct 2016 11:46:22 +0200 nipkow setsum -> sum
Wed, 10 Aug 2016 14:50:59 +0200 wenzelm tuned proofs;
Tue, 31 May 2016 13:02:44 +0200 eberlm Added code generation for PMFs
Tue, 01 Sep 2015 22:32:58 +0200 wenzelm eliminated \<Colon>;
Mon, 06 Jul 2015 22:57:34 +0200 wenzelm tuned proofs;
Thu, 25 Jun 2015 23:33:47 +0200 wenzelm tuned proofs;
Wed, 17 Jun 2015 11:03:05 +0200 wenzelm isabelle update_cartouches;
Sun, 02 Nov 2014 17:20:45 +0100 wenzelm modernized header;
Thu, 18 Sep 2014 15:07:43 +0200 haftmann product over monoids for lists
Thu, 11 Sep 2014 18:54:36 +0200 blanchet fixed situation in 'primrec' whereby the original value of a constructor argument of nested type was not translated correctly to a 'map fst'
Thu, 07 Aug 2014 12:17:41 +0200 blanchet no need for 'set_simps' now that 'datatype_new' generates the desired 'set' property
Sat, 05 Jul 2014 11:01:53 +0200 haftmann prefer ac_simps collections over separate name bindings for add and mult
Tue, 29 Apr 2014 16:02:02 +0200 wenzelm prefer plain ASCII / latex over not-so-universal Unicode;
Thu, 10 Apr 2014 17:48:15 +0200 kuncar more appropriate name (Lifting.invariant -> eq_onp)
Wed, 19 Mar 2014 18:47:22 +0100 haftmann elongated INFI and SUPR, to reduced risk of confusing theorems names in the future while still being consistent with INTER and UNION
Tue, 18 Mar 2014 22:11:46 +0100 haftmann consolidated theorem names containing INFI and SUPR: have INF and SUP instead uniformly
Mon, 10 Mar 2014 17:14:57 +0100 kuncar hide implementation details
Wed, 19 Feb 2014 16:32:37 +0100 blanchet merged 'List.set' with BNF-generated 'set'
Tue, 18 Feb 2014 23:03:50 +0100 kuncar simplify proofs because of the stronger reflexivity prover
Tue, 05 Nov 2013 09:45:02 +0100 hoelzl move Lubs from HOL to HOL-Library (replaced by conditionally complete lattices)
Fri, 27 Sep 2013 16:48:47 +0200 nipkow added Bleast code eqns for RBT
Fri, 20 Sep 2013 10:09:16 +0200 Andreas Lochbihler prefer Code.abort over code_abort
Tue, 26 Mar 2013 20:49:57 +0100 haftmann explicit sublocale dependency for Min/Max yields more appropriate Min/Max prefix for a couple of facts
Sat, 23 Mar 2013 20:50:39 +0100 haftmann fundamental revision of big operators on sets
Thu, 14 Feb 2013 14:14:55 +0100 haftmann consolidation of library theories on product orders
Tue, 15 Jan 2013 12:13:27 +0100 kuncar restore code equations for List.set in RBT_Set; make Scala happy according to 7.1 in the code generator manual
Sat, 20 Oct 2012 09:12:16 +0200 haftmann moved quite generic material from theory Enum to more appropriate places
Thu, 18 Oct 2012 15:52:32 +0200 kuncar tuned proofs
Tue, 09 Oct 2012 16:58:36 +0200 kuncar use Set.filter instead of Finite_Set.filter, which is removed then
Tue, 09 Oct 2012 16:57:58 +0200 kuncar rename Set.project to Set.filter - more appropriate name
Tue, 31 Jul 2012 13:55:39 +0200 kuncar implementation of sets by RBT trees for the code generator
less more (0) tip