Fri, 07 Jun 2013 10:24:35 +0200 blanchet tuning
Fri, 07 Jun 2013 09:47:04 +0200 blanchet tuning
Fri, 07 Jun 2013 09:30:13 +0200 blanchet tuning
Fri, 07 Jun 2013 22:13:04 +0200 nipkow tuned
Fri, 07 Jun 2013 12:55:09 +0200 nipkow tuned variable names
Fri, 07 Jun 2013 11:51:52 +0200 nipkow tuned
Fri, 07 Jun 2013 09:28:59 +0200 blanchet tuning
Fri, 07 Jun 2013 08:57:44 +0200 blanchet tuning
Fri, 07 Jun 2013 08:48:59 +0200 blanchet [mq]: tuning
Thu, 06 Jun 2013 22:01:42 +0200 blanchet tuning
Thu, 06 Jun 2013 21:32:39 +0200 blanchet tuning
Thu, 06 Jun 2013 21:22:04 +0200 blanchet tuning
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, 06 Jun 2013 15:56:17 +0200 blanchet too much qualification is like too little
Thu, 06 Jun 2013 15:49:09 +0200 blanchet tuning
Thu, 06 Jun 2013 15:49:09 +0200 blanchet tuning
Thu, 06 Jun 2013 15:49:08 +0200 blanchet tuning
Thu, 06 Jun 2013 15:49:01 +0200 blanchet merge
Thu, 06 Jun 2013 12:20:04 +0200 blanchet tuning
Thu, 06 Jun 2013 14:52:54 +0200 nipkow tuned defs
Thu, 06 Jun 2013 12:16:35 +0200 blanchet avoid duplicate call to "mk_fold_rec_args_types" function
Thu, 06 Jun 2013 11:47:11 +0200 blanchet continuation of f461dca57c66
Thu, 06 Jun 2013 11:41:19 +0200 blanchet renamed ML variables
Thu, 06 Jun 2013 11:33:41 +0200 blanchet tuned record field names to avoid confusion between low-level and high-level constants/theorems
Thu, 06 Jun 2013 11:19:04 +0200 blanchet tuned signature
Thu, 06 Jun 2013 09:17:17 +0200 blanchet support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
Thu, 06 Jun 2013 08:40:37 +0200 blanchet tuned ML variable names
Wed, 05 Jun 2013 15:33:01 +0200 kuncar transfer rule for listsum
Wed, 05 Jun 2013 15:21:52 +0200 kuncar more reflexivity rules (for OO)
Wed, 05 Jun 2013 13:39:02 +0200 blanchet tuning
Wed, 05 Jun 2013 13:31:32 +0200 blanchet avoid code duplication
Wed, 05 Jun 2013 13:22:44 +0200 blanchet eliminated dead argument
Wed, 05 Jun 2013 13:19:26 +0200 blanchet one less flaky "fpTs" check (flaky in the presence of duplicates in "fpTs", which we want to have in "primrec")
Wed, 05 Jun 2013 13:13:35 +0200 blanchet tuning
Wed, 05 Jun 2013 12:51:16 +0200 blanchet simpler, more robust iterator goal construction code
Wed, 05 Jun 2013 11:30:24 +0200 blanchet tuning
Wed, 05 Jun 2013 11:16:46 +0200 blanchet reverted 23929f647f79 -- not needed after all
Wed, 05 Jun 2013 10:27:46 +0200 blanchet killed dead code
Wed, 05 Jun 2013 10:21:35 +0200 blanchet tuning
Wed, 05 Jun 2013 10:05:08 +0200 blanchet slightly nicer ML interface
Wed, 05 Jun 2013 09:56:28 +0200 blanchet added convenience function
Wed, 05 Jun 2013 09:24:16 +0200 blanchet keep a record of the fixpoint equations
Wed, 05 Jun 2013 08:57:43 +0200 blanchet export ML function (needed for "primrec_new")
Tue, 04 Jun 2013 12:11:48 +0200 blanchet export ML function
Mon, 03 Jun 2013 11:37:37 +0200 nipkow corrected name
Mon, 03 Jun 2013 06:41:07 +0200 nipkow tuned proofs
Sun, 02 Jun 2013 20:44:55 +0200 haftmann type class for confined subtraction
Sun, 02 Jun 2013 10:57:21 +0200 haftmann denesting of functions
Sun, 02 Jun 2013 09:10:53 +0200 haftmann some meagure hints concerning reification
Sun, 02 Jun 2013 07:46:40 +0200 haftmann make reification part of HOL
Sat, 01 Jun 2013 14:26:04 +0200 wenzelm permissive uncheck -- allow printing of malformed terms (e.g. in error messages);
Sat, 01 Jun 2013 14:16:10 +0200 wenzelm Type_Annotation only works *after* uncheck (which usually requires authentic type information);
Sat, 01 Jun 2013 12:03:37 +0200 wenzelm updated isatest stats;
Sat, 01 Jun 2013 12:02:41 +0200 nipkow tuned theory name
Sat, 01 Jun 2013 11:48:06 +0200 nipkow tuned rules
Fri, 31 May 2013 14:08:48 +0200 blanchet tuning
Fri, 31 May 2013 12:28:39 +0200 blanchet renamed util function
Fri, 31 May 2013 12:00:18 +0200 wenzelm tuned;
Fri, 31 May 2013 11:56:48 +0200 wenzelm make SML/NJ partially happy;
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 tip