src/HOL/BNF/Tools/bnf_fp_def_sugar_tactics.ML
Fri, 20 Dec 2013 16:22:10 +0100 blanchet tuning whitespace
Sat, 14 Dec 2013 17:28:05 +0100 wenzelm proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
Mon, 04 Nov 2013 11:59:08 +0100 blanchet strengthened tactic
Thu, 24 Oct 2013 15:32:34 +0200 blanchet got rid of annoying duplicate rewrite rule warnings
Wed, 18 Sep 2013 15:33:30 +0200 blanchet avoid duplicate simp rule warnings
Thu, 12 Sep 2013 17:36:06 +0200 blanchet made tactic handle gracefully the case: codatatype ('a, 's) scheduler2 = Combine2 "'s => 'a" "'s => ('a, 's) scheduler2"
Fri, 30 Aug 2013 14:17:19 +0200 blanchet more canonical naming
Thu, 29 Aug 2013 23:01:04 +0200 blanchet renamed BNF fact
Thu, 29 Aug 2013 22:39:46 +0200 blanchet renamed BNF fact
Mon, 12 Aug 2013 15:25:17 +0200 blanchet define case constant from other 'free constructor' axioms
Mon, 12 Aug 2013 15:25:16 +0200 blanchet tuning
Mon, 15 Jul 2013 14:23:51 +0200 traytel eliminate duplicated theorems (thanks to "Auto solve_direct" in jEdit)
Fri, 07 Jun 2013 17:04:55 +0100 blanchet code simplifications (cf. 78a3d5006cf1)
Fri, 07 Jun 2013 14:45:07 +0200 blanchet changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
Thu, 06 Jun 2013 21:18:39 +0200 blanchet tuning
Thu, 06 Jun 2013 21:12:08 +0200 blanchet fixed failure in coinduction rule tactic
Thu, 30 May 2013 12:56:25 +0200 wenzelm stay within regular tactic language -- avoid operating on whole proof state;
Wed, 29 May 2013 02:35:49 +0200 blanchet generalized recursors, effectively reverting inductive half of c7a034d01936
Tue, 28 May 2013 08:36:12 +0200 blanchet clean up list of theorems
Tue, 28 May 2013 08:36:11 +0200 blanchet removed needless comment (yes, sum_case_if is needed)
Tue, 07 May 2013 14:22:54 +0200 traytel got rid of the set based relator---use (binary) predicate based relator instead
Wed, 01 May 2013 19:33:49 +0200 blanchet renamed a few FP-related files, to make it clear that these are not the sum of LFP + GFP but rather shared basic libraries
Tue, 30 Apr 2013 16:42:23 +0200 blanchet rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
Sat, 27 Apr 2013 20:50:20 +0200 wenzelm uniform Proof.context for hyp_subst_tac;
Wed, 24 Apr 2013 17:47:22 +0200 blanchet renamed "set_natural" to "set_map", reflecting {Bl,Po,Tr} concensus
Thu, 18 Apr 2013 17:07:01 +0200 wenzelm simplifier uses proper Proof.context instead of historic type simpset;
Tue, 02 Oct 2012 01:00:18 +0200 blanchet continued changing type of corec type
Tue, 02 Oct 2012 01:00:18 +0200 blanchet made (co)rec tactic more robust when the simplifier succeeds early
Mon, 01 Oct 2012 11:04:30 +0200 blanchet fixed recursor definition for datatypes with inner products (e.g. "'a trm" from the lambda-term example)
Mon, 01 Oct 2012 10:46:30 +0200 blanchet tweaked corecursor/coiterator tactic
less more (0) -30 tip