src/HOL/Library/RBT.thy
Wed, 21 Apr 2010 11:23:04 +0200 hoelzl merged
Fri, 16 Apr 2010 21:28:09 +0200 wenzelm replaced generic 'hide' command by more conventional 'hide_class', 'hide_type', 'hide_const', 'hide_fact' -- frees some popular keywords;
Thu, 15 Apr 2010 12:27:14 +0200 haftmann theory RBT with abstract type of red-black trees backed by implementation RBT_Impl
Sat, 06 Mar 2010 15:31:30 +0100 haftmann some lemma refinements
Sat, 06 Mar 2010 09:58:28 +0100 haftmann added bulkload; tuned document
Fri, 05 Mar 2010 17:55:14 +0100 haftmann moved lemma map_sorted_distinct_set_unique
Fri, 05 Mar 2010 17:51:29 +0100 haftmann various refinements
Wed, 03 Mar 2010 17:21:45 +0100 haftmann restructured RBT theory
Wed, 03 Mar 2010 08:28:33 +0100 haftmann more explicit naming scheme
Tue, 28 Jul 2009 08:49:03 +0200 krauss tuned
Mon, 27 Jul 2009 22:50:04 +0200 krauss added missing proof of RBT.map_of_alist_of (contributed by Peter Lammich)
Fri, 27 Mar 2009 10:05:11 +0100 haftmann normalized imports
Wed, 04 Mar 2009 10:47:20 +0100 nipkow Made Option a separate theory and renamed option_map to Option.map
Thu, 26 Jun 2008 10:07:01 +0200 haftmann established Plain theory and image
Mon, 03 Mar 2008 14:03:19 +0100 krauss new theory of red-black trees, an efficient implementation of finite maps.
less more (0) tip