src/HOL/Codatatype/Tools/bnf_fp_sugar.ML
Fri, 21 Sep 2012 16:34:40 +0200 renamed top-level theory from "Codatatype" to "BNF"
Fri, 21 Sep 2012 15:53:29 +0200 fixed bug introduced by fold/unfold renaming
Fri, 21 Sep 2012 15:53:29 +0200 renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
Fri, 21 Sep 2012 15:53:29 +0200 tuned a few ML names
Fri, 21 Sep 2012 15:53:29 +0200 renamed "fld"/"unf" to "ctor"/"dtor"
Fri, 21 Sep 2012 15:53:29 +0200 tuned variable names
Thu, 20 Sep 2012 17:35:49 +0200 finished "disc_coiter_iff" etc. generation
Thu, 20 Sep 2012 17:25:07 +0200 generate coiter_iff and corec_iff theorems
Thu, 20 Sep 2012 13:32:48 +0200 added "simp"s to coiter/corec theorems + export under "simps" name
Thu, 20 Sep 2012 13:32:48 +0200 tuning
Thu, 20 Sep 2012 02:42:49 +0200 provide predicator, define relator
Thu, 20 Sep 2012 02:42:48 +0200 tuning
Thu, 20 Sep 2012 02:42:48 +0200 renamed "bnf_fp_util.ML" to "bnf_fp.ML"
Thu, 20 Sep 2012 02:42:48 +0200 tuned ID/DEADID setup
Tue, 18 Sep 2012 11:42:22 +0200 group "simps" together
Tue, 18 Sep 2012 11:42:11 +0200 register induct attributes
Tue, 18 Sep 2012 09:15:53 +0200 separated registration of BNFs from bnf_def (BNFs are now stored only for bnf_def and (co)data commands)
Mon, 17 Sep 2012 21:13:30 +0200 cleaner way of dealing with the set functions of sums and products
Mon, 17 Sep 2012 21:13:30 +0200 clean unfolding of prod and sum sets
Mon, 17 Sep 2012 21:13:30 +0200 got rid of one "auto" in induction tactic
Sat, 15 Sep 2012 23:53:10 +0200 tuning
Sat, 15 Sep 2012 21:10:26 +0200 tuned code to avoid special case for "fun"
Sat, 15 Sep 2012 21:10:26 +0200 tuning
Fri, 14 Sep 2012 22:23:11 +0200 fixed bug in "mk_map" for the "fun" case
Fri, 14 Sep 2012 22:23:10 +0200 fixed issue with bound variables in prem prems + tuning
Fri, 14 Sep 2012 22:23:10 +0200 use right version of "mk_UnIN"
Fri, 14 Sep 2012 22:23:10 +0200 select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
Fri, 14 Sep 2012 22:23:10 +0200 tuned code before fixing "mk_induct_discharge_prem_prems_tac"
Fri, 14 Sep 2012 12:09:27 +0200 polished the induction
Fri, 14 Sep 2012 12:09:27 +0200 put the flat at the right place (to avoid exceptions)
Fri, 14 Sep 2012 12:09:27 +0200 fixed variable exporting problem
Fri, 14 Sep 2012 12:09:27 +0200 added induct tactic
Fri, 14 Sep 2012 12:09:27 +0200 tuning
Fri, 14 Sep 2012 12:09:27 +0200 renamed "mk_UnN" to "mk_UnIN"
Fri, 14 Sep 2012 12:09:27 +0200 distinguish between nested and nesting BNFs
Fri, 14 Sep 2012 12:09:27 +0200 make tactic more robust in the case where "asm_simp_tac" already finishes the job
Fri, 14 Sep 2012 12:09:27 +0200 derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
Wed, 12 Sep 2012 23:06:39 +0200 rough and ready induction
Wed, 12 Sep 2012 17:26:05 +0200 tuning
Wed, 12 Sep 2012 17:26:05 +0200 set up things for (co)induction sugar
Wed, 12 Sep 2012 17:26:05 +0200 tuning
Wed, 12 Sep 2012 12:06:03 +0200 reuse generated names (they look better + slightly more efficient)
Wed, 12 Sep 2012 11:47:51 +0200 desambiguate grammar (e.g. for Nil's mixfix ("[]"))
Wed, 12 Sep 2012 06:27:36 +0200 tuning
Wed, 12 Sep 2012 05:03:18 +0200 reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
Wed, 12 Sep 2012 00:55:11 +0200 added optional qualifiers for constructors and destructors, similarly to the old package
Wed, 12 Sep 2012 00:20:37 +0200 added attributes to theorems
Tue, 11 Sep 2012 22:31:43 +0200 support for sort constraints in new (co)data commands
Tue, 11 Sep 2012 22:13:22 +0200 provide a programmatic interface for FP sugar
Tue, 11 Sep 2012 18:58:29 +0200 allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
Tue, 11 Sep 2012 18:39:47 +0200 added "defaults" option
Tue, 11 Sep 2012 16:08:55 +0200 allow default values for selectors in low-level "wrap_data" command
Tue, 11 Sep 2012 14:51:52 +0200 added no_dests option
Tue, 11 Sep 2012 13:10:34 +0200 tuning
Tue, 11 Sep 2012 13:06:14 +0200 finished splitting sum types for corecursors
Tue, 11 Sep 2012 13:06:14 +0200 split sum types in corecursor definition
Tue, 11 Sep 2012 13:06:13 +0200 first step towards splitting corecursor function arguments into (p, g, h) triples
Tue, 11 Sep 2012 13:06:13 +0200 reverted "id" change: The problem is rather that the "%c. f c" argument sometimes gets eta-reduced
Tue, 11 Sep 2012 09:40:05 +0200 generate "id" rather than (%v. v)
Tue, 11 Sep 2012 09:40:05 +0200 correctly generate sel_coiter and sel_corec theorems