src/HOL/Nominal/nominal_package.ML
Wed, 28 Mar 2007 19:17:40 +0200 berghofe Renamed induct(s)_weak to weak_induct(s) in order to unify
Tue, 27 Mar 2007 17:54:37 +0200 berghofe Exported perm_of_pair, mk_not_sym, and perm_simproc.
Sat, 10 Mar 2007 16:28:06 +0100 berghofe - Changed format of descriptor contained in nominal_datatype_info
Tue, 13 Feb 2007 18:16:50 +0100 berghofe Curried and exported mk_perm.
Wed, 07 Feb 2007 17:51:38 +0100 berghofe Adapted to changes in Finite_Set theory.
Tue, 06 Feb 2007 00:41:54 +0100 urbanc moved the infrastructure from the nominal_tags file to nominal_thmdecls
Fri, 02 Feb 2007 17:16:16 +0100 urbanc added an infrastructure that allows the user to declare lemmas to be equivariance lemmas; the intention is to use these lemmas in automated tools but also can be employed by the user
Fri, 15 Dec 2006 00:08:06 +0100 wenzelm avoid conflict with Alice keywords: renamed pack -> implode, unpack -> explode, any -> many, avoided assert;
Wed, 06 Dec 2006 01:12:36 +0100 wenzelm removed legacy ML bindings;
Mon, 27 Nov 2006 12:09:55 +0100 berghofe Additional information about nominal datatypes (descriptor,
Fri, 24 Nov 2006 22:05:12 +0100 wenzelm ProofContext.init;
Wed, 15 Nov 2006 16:23:55 +0100 urbanc replaced exists_fresh lemma with a version formulated with obtains;
Tue, 14 Nov 2006 22:16:55 +0100 wenzelm InductivePackage.add_inductive_i: canonical argument order;
Fri, 10 Nov 2006 22:18:51 +0100 wenzelm simplified LocalTheory.exit;
Mon, 23 Oct 2006 00:52:15 +0200 berghofe Added freshness context to FCBs.
Fri, 20 Oct 2006 14:13:48 +0200 berghofe Proof of "bs # fK bs us vs" no longer depends on FCBs.
Thu, 19 Oct 2006 12:08:27 +0200 berghofe Induction rule for graph of recursion combinator
Thu, 19 Oct 2006 11:21:01 +0200 berghofe Split up FCBs into separate formulae for each binder.
Fri, 13 Oct 2006 18:18:58 +0200 berghofe Adapted to new inductive definition package.
Fri, 15 Sep 2006 22:56:13 +0200 wenzelm renamed Term.map_term_types to Term.map_types (cf. Term.fold_types);
Wed, 06 Sep 2006 10:01:04 +0200 haftmann TypedefPackage.add_typedef_* now yields name of introduced type constructor
Thu, 24 Aug 2006 15:20:43 +0200 berghofe Added premises concerning finite support of recursion results to FCBs.
Fri, 18 Aug 2006 17:03:23 +0200 berghofe - Fixed bug that caused uniqueness proof for recursion
Mon, 14 Aug 2006 11:25:08 +0200 berghofe Finished implementation of uniqueness proof for recursion combinator.
Mon, 31 Jul 2006 14:08:42 +0200 berghofe Additional freshness constraints for FCB.
Fri, 21 Jul 2006 14:48:17 +0200 haftmann adaption to argument change in primrec_package
Tue, 18 Jul 2006 17:10:22 +0200 berghofe Started implementing uniqueness proof for recursion
Tue, 11 Jul 2006 12:16:54 +0200 wenzelm replaced Term.variant(list) by Name.variant(_list);
Sat, 08 Jul 2006 12:54:33 +0200 wenzelm Goal.prove_global;
Tue, 04 Jul 2006 15:20:43 +0200 berghofe Implemented proofs of equivariance and finite support
Tue, 13 Jun 2006 23:41:34 +0200 wenzelm ProjectRule now context dependent;
Mon, 12 Jun 2006 00:36:52 +0200 berghofe Completely rewrote code for defining graph of recursion combinator.
Fri, 09 Jun 2006 17:30:52 +0200 berghofe - Changed naming scheme: names of "internal" constructors now have
Wed, 24 May 2006 10:02:36 +0200 berghofe Extended strong induction rule with additional
Tue, 16 May 2006 13:05:14 +0200 wenzelm Sign.certify_sort;
Sat, 13 May 2006 02:51:48 +0200 wenzelm unchecked definitions;
Fri, 28 Apr 2006 15:54:34 +0200 berghofe Renamed "nominal" theory to "Nominal".
Thu, 27 Apr 2006 17:48:41 +0200 berghofe SplitAt -> chop
Mon, 10 Apr 2006 14:37:23 +0200 berghofe Adapted to changed type of add_typedef_i.
Thu, 23 Mar 2006 18:14:06 +0100 berghofe Replaced iteration combinator by recursion combinator.
Wed, 15 Mar 2006 17:59:33 +0100 berghofe add_inst_arity_i renamed to prove_arity.
Mon, 13 Mar 2006 00:09:23 +0100 berghofe First version of function for defining graph of iteration combinator.
Fri, 24 Feb 2006 17:48:17 +0100 berghofe Reverted to old interface of AxClass.add_inst_arity(_i)
Fri, 24 Feb 2006 09:00:21 +0100 berghofe Adapted to Florian's recent changes to the AxClass package.
Mon, 23 Jan 2006 15:23:31 +0100 krauss Updated to Isabelle 2006-01-23
Thu, 19 Jan 2006 15:45:10 +0100 berghofe Use generic Simplifier.simp_add attribute instead
Wed, 11 Jan 2006 18:21:23 +0100 berghofe Implemented proof of (strong) induction rule.
Thu, 05 Jan 2006 17:16:38 +0100 wenzelm provide projections of induct_weak, induct_unsafe;
Thu, 05 Jan 2006 12:09:26 +0100 urbanc changed the name of the type "nOption" to "noption".
Sat, 10 Dec 2005 00:11:35 +0100 urbanc changed the types in accordance with Florian's changes
Thu, 08 Dec 2005 10:17:21 +0100 berghofe Adapted to new type of PureThy.add_defs_i.
Mon, 05 Dec 2005 00:39:18 +0100 berghofe Adapted to new type of store_thmss(_atts).
Wed, 30 Nov 2005 16:59:19 +0100 berghofe Changed order of predicate arguments and quantifiers in strong induction rule.
Tue, 29 Nov 2005 12:26:22 +0100 berghofe Corrected atom class constraints in strong induction rule.
Sat, 26 Nov 2005 18:41:41 +0100 berghofe Corrected treatment of non-recursive abstraction types.
Fri, 25 Nov 2005 14:51:39 +0100 urbanc added fsub.thy (poplmark challenge) to the examples
Fri, 25 Nov 2005 14:00:22 +0100 berghofe Fixed problem with strong induction theorem for datatypes containing
Thu, 10 Nov 2005 00:36:26 +0100 urbanc called the induction principle "unsafe" instead of "test".
Mon, 07 Nov 2005 18:32:54 +0100 berghofe Added strong induction theorem (currently only axiomatized!).
Mon, 07 Nov 2005 14:35:25 +0100 urbanc added thms perm, distinct and fresh to the simplifier.
less more (0) -60 tip