src/HOL/Data_Structures/Binomial_Heap.thy
Tue, 05 Jan 2021 11:24:35 +0100 nipkow tuned
Thu, 17 Dec 2020 13:51:22 +0000 Peter Lammich tuned running time functions
Wed, 16 Dec 2020 17:47:50 +0000 Peter Lammich simplified complexity proofs. Increased precision of T_del_min_bound. (though T_del_min might be be missing a +1)
Wed, 16 Dec 2020 16:53:13 +0000 Peter Lammich added missing +1 to T_insert (for function call)
Tue, 15 Dec 2020 17:22:27 +0000 Peter Lammich removed redundant T_xxx_bound_aux lemmas
Fri, 04 Dec 2020 17:54:57 +0000 Peter Lammich removed session name
Fri, 04 Dec 2020 17:20:41 +0000 Peter Lammich summarized structural and ordering invariant for trees
Thu, 26 Nov 2020 15:51:20 +0000 Peter Lammich renaming
Fri, 06 Nov 2020 12:59:38 +0100 blanchet undid renaming accident
Fri, 06 Nov 2020 12:48:31 +0100 blanchet renamed t_ functions to T_ (im Auftrag von T. Nipkow)
Fri, 23 Aug 2019 21:08:27 +0200 nipkow tuned
Wed, 31 Jul 2019 09:04:00 +0200 nipkow reduced dependencies
Sat, 05 Jan 2019 17:24:33 +0100 wenzelm isabelle update -u control_cartouches;
Mon, 25 Jun 2018 14:45:05 +0200 nipkow added lemmas; uniform names
Tue, 08 May 2018 10:14:36 +0200 nipkow new def of sorted and sorted_wrt
Sat, 21 Apr 2018 11:13:35 +0200 nipkow dont rename PQ.del_min
Sat, 21 Apr 2018 08:41:42 +0200 nipkow del_min -> split_min
Mon, 22 Jan 2018 15:50:29 +0100 Lars Hupel tuned
Wed, 10 Jan 2018 15:25:09 +0100 nipkow ran isabelle update_op on all sources
Thu, 31 Aug 2017 08:39:42 +0200 nipkow added PQ with merge
Tue, 29 Aug 2017 17:01:11 +0200 nipkow tuned names
Tue, 29 Aug 2017 16:54:54 +0200 nipkow simpler definition
Tue, 29 Aug 2017 15:37:02 +0200 nipkow typo
Tue, 29 Aug 2017 15:07:15 +0200 nipkow tuned
Sun, 27 Aug 2017 16:56:25 +0200 nipkow tuning
Wed, 23 Aug 2017 20:41:15 +0200 nipkow reorg
Tue, 15 Aug 2017 19:47:08 +0200 nipkow added sorted_wrt to List; added Data_Structures/Binomial_Heap.thy
less more (0) tip