src/HOL/Tools/set_comprehension_pointfree.ML
Wed, 10 Jan 2018 15:25:09 +0100 nipkow ran isabelle update_op on all sources
Tue, 13 Oct 2015 09:21:15 +0200 haftmann prod_case as canonical name for product type eliminator
Sun, 06 Sep 2015 22:14:51 +0200 haftmann prefer "uncurry" as canonical name for case distinction on products in combinatorial view
Sat, 25 Jul 2015 23:41:53 +0200 wenzelm updated to infer_instantiate;
Wed, 08 Jul 2015 21:33:00 +0200 wenzelm clarified context;
Fri, 06 Mar 2015 15:58:56 +0100 wenzelm Thm.cterm_of and Thm.ctyp_of operate on local context;
Wed, 04 Mar 2015 19:53:18 +0100 wenzelm tuned signature -- prefer qualified names;
Tue, 03 Mar 2015 19:08:04 +0100 traytel eliminated some clones of Proof_Context.cterm_of
Tue, 10 Feb 2015 14:48:26 +0100 wenzelm proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
Wed, 26 Nov 2014 20:05:34 +0100 wenzelm renamed "pairself" to "apply2", in accordance to @{apply 2};
Mon, 10 Nov 2014 21:49:48 +0100 wenzelm proper context for assume_tac (atac remains as fall-back without context);
Thu, 30 Oct 2014 22:45:19 +0100 wenzelm eliminated aliases;
Fri, 21 Feb 2014 00:09:56 +0100 blanchet adapted to renaming of datatype 'cases' and 'recs' to 'case' and 'rec'
Wed, 12 Feb 2014 08:35:57 +0100 blanchet renamed '{prod,sum,bool,unit}_case' to 'case_...'
Sat, 27 Apr 2013 20:50:20 +0200 wenzelm uniform Proof.context for hyp_subst_tac;
Thu, 18 Apr 2013 17:07:01 +0200 wenzelm simplifier uses proper Proof.context instead of historic type simpset;
Thu, 28 Feb 2013 17:14:55 +0100 wenzelm provide common HOLogic.conj_conv and HOLogic.eq_conv;
Thu, 28 Feb 2013 16:54:52 +0100 wenzelm just one HOLogic.Trueprop_conv, with regular exception CTERM;
Thu, 08 Nov 2012 19:55:37 +0100 bulwahn using hyp_subst_tac that allows to pass the current simpset to avoid the renamed bound variable warning in the simplifier
Thu, 08 Nov 2012 19:55:17 +0100 bulwahn rewriting with the simpset that is passed to the simproc
Thu, 08 Nov 2012 17:11:04 +0100 bulwahn handling x : S y pattern with the default mechanism instead of raising an exception in the set_comprehension_pointfree simproc
Thu, 08 Nov 2012 17:06:59 +0100 bulwahn tuned
Thu, 08 Nov 2012 16:25:26 +0100 bulwahn syntactic tuning and restructuring of set_comprehension_pointfree simproc
Thu, 08 Nov 2012 11:59:50 +0100 bulwahn using more proper simpset in tactic of set_comprehension_pointfree simproc to avoid renamed bound variable warnings in recursive simplifier calls
Thu, 08 Nov 2012 11:59:49 +0100 bulwahn improving the extension of sets in case of more than one bound variable; rearranging the tactic to prefer simpler steps before more involved ones
Thu, 08 Nov 2012 11:59:47 +0100 bulwahn importing term with schematic type variables properly before passing it to the tactic in the set_comprehension_pointfree simproc
Thu, 08 Nov 2012 11:59:47 +0100 bulwahn handling arbitrary terms in the set comprehension and more general merging of patterns possible in the set_comprehension_pointfree simproc
Thu, 08 Nov 2012 11:59:46 +0100 bulwahn simplified structure of patterns in set_comprehension_simproc
Sun, 21 Oct 2012 08:39:41 +0200 bulwahn another refinement in the comprehension conversion
Sun, 21 Oct 2012 05:24:59 +0200 bulwahn refined simplifier call in comprehension_conv
less more (0) -50 -30 tip