src/HOL/BNF/Tools/bnf_fp_def_sugar_tactics.ML
2013-05-01 blanchet 2013-05-01 renamed a few FP-related files, to make it clear that these are not the sum of LFP + GFP but rather shared basic libraries
2013-04-30 blanchet 2013-04-30 rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
2013-04-27 wenzelm 2013-04-27 uniform Proof.context for hyp_subst_tac;
2013-04-24 blanchet 2013-04-24 renamed "set_natural" to "set_map", reflecting {Bl,Po,Tr} concensus
2013-04-18 wenzelm 2013-04-18 simplifier uses proper Proof.context instead of historic type simpset;
2012-10-02 blanchet 2012-10-02 continued changing type of corec type
2012-10-02 blanchet 2012-10-02 made (co)rec tactic more robust when the simplifier succeeds early
2012-10-01 blanchet 2012-10-01 fixed recursor definition for datatypes with inner products (e.g. "'a trm" from the lambda-term example)
2012-10-01 blanchet 2012-10-01 tweaked corecursor/coiterator tactic
2012-10-01 blanchet 2012-10-01 changed the type of the recursor for nested recursion
2012-09-30 blanchet 2012-09-30 tuning
2012-09-30 traytel 2012-09-30 tuned tactic
2012-09-28 blanchet 2012-09-28 simplified simpset
2012-09-28 blanchet 2012-09-28 fixed simplification of prod and sum relators to avoid issues with e.g. codata ('a, 'b) k = K "'a + 'b"
2012-09-28 traytel 2012-09-28 tuned tactic
2012-09-28 traytel 2012-09-28 tuned tactic
2012-09-28 blanchet 2012-09-28 renamed ML file in preparation for next step