src/HOL/Data_Structures/Binomial_Heap.thy
Fri, 08 Nov 2024 11:18:08 +0100 nipkow tuned
Sun, 24 Mar 2024 14:50:47 +0100 nipkow more uniform command names
Mon, 19 Feb 2024 08:23:23 +0100 nipkow use define_time_fun
Wed, 06 Dec 2023 12:06:29 +0100 nipkow tuned T functions: now 0 if not recursive
Mon, 25 Jul 2022 12:19:59 +0200 nipkow replaced complicated lemma by a simpler one
Fri, 15 Jul 2022 08:46:04 +0200 nipkow tuned names
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
less more (0) -15 tip