src/HOL/Data_Structures/Braun_Tree.thy
Tue, 17 Dec 2019 08:05:59 +0100 nipkow slicker proofs (used in CPP paper)
Mon, 07 Oct 2019 14:31:46 +0200 nipkow simplified proof
Sun, 30 Dec 2018 10:34:56 +0000 haftmann prefer naming convention from datatype package for strong congruence rules
Sun, 28 Oct 2018 11:00:00 +0100 nipkow tuned names
Sat, 27 Oct 2018 15:30:38 +0200 nipkow moved lemmas
Fri, 26 Oct 2018 21:19:07 +0200 nipkow tuned
Fri, 26 Oct 2018 21:07:30 +0200 nipkow tuned and added lemmas
Fri, 26 Oct 2018 15:58:41 +0200 nipkow avoid abbreviation that is used only locally
Fri, 26 Oct 2018 14:11:59 +0200 nipkow more combinatorics lemmas
Wed, 17 Oct 2018 07:50:46 +0200 nipkow more intuitive and simpler (but slower) proofs
Sun, 07 Oct 2018 16:28:38 +0200 nipkow added Braun_Tree.thy
less more (0) tip