src/HOL/Wellfounded_Recursion.thy
Fri, 07 Mar 2008 13:53:04 +0100 haftmann whitespace tuning
Thu, 28 Feb 2008 12:56:30 +0100 wenzelm wf_trancl: structured proof;
Thu, 21 Feb 2008 17:33:58 +0100 nipkow moved bij_betw from Library/FuncSet to Fun, redistributed some lemmas, and
Fri, 15 Feb 2008 16:09:12 +0100 haftmann <= and < on nat no longer depend on wellfounded relations
Wed, 06 Feb 2008 16:06:40 +0100 krauss lemma wf_union_compatible: "wf R ==> wf S ==> S O R <= R ==> wf (R Un S)"
Tue, 13 Nov 2007 11:02:55 +0100 berghofe Removed some case_names and consumes attributes that are now no longer
Fri, 26 Oct 2007 21:22:18 +0200 haftmann dropped square syntax
Wed, 11 Jul 2007 11:11:39 +0200 berghofe Adapted to changes in infrastructure for converting between
Thu, 14 Jun 2007 18:33:31 +0200 wenzelm tuned proofs: avoid implicit prems;
Fri, 01 Jun 2007 15:14:05 +0200 krauss Added "merge-lemma" about wellfoundedness of unions (useful for some termination proofs)
Sun, 06 May 2007 21:50:17 +0200 haftmann changed code generator invocation syntax
Sat, 21 Apr 2007 19:32:32 +0200 huffman faster proof of wf_eq_minimal
Fri, 02 Mar 2007 15:43:21 +0100 haftmann now using "class"
Wed, 07 Feb 2007 17:29:41 +0100 berghofe - Adapted to new inductive definition package
less more (0) -14 tip