Wed, 29 Sep 2010 10:33:15 +0200 added a test case to Predicate_Compile_Tests
bulwahn [Wed, 29 Sep 2010 10:33:15 +0200] rev 39784
added a test case to Predicate_Compile_Tests
Wed, 29 Sep 2010 10:33:14 +0200 putting the last step of the proof in a TRY block to handle the case that the simplifier already solved the goal
bulwahn [Wed, 29 Sep 2010 10:33:14 +0200] rev 39783
putting the last step of the proof in a TRY block to handle the case that the simplifier already solved the goal
Wed, 29 Sep 2010 11:02:24 +0200 backed out my old attempt at single_hyp_subst_tac (67cd6ed76446)
krauss [Wed, 29 Sep 2010 11:02:24 +0200] rev 39782
backed out my old attempt at single_hyp_subst_tac (67cd6ed76446) It never was totally reliable, and better alternatives now exist (Subgoal.FOCUS).
Wed, 29 Sep 2010 10:05:44 +0200 scala is reserved identifier
haftmann [Wed, 29 Sep 2010 10:05:44 +0200] rev 39781
scala is reserved identifier
Wed, 29 Sep 2010 09:21:26 +0200 platform-sensitive contrib paths for ghc, ocaml
haftmann [Wed, 29 Sep 2010 09:21:26 +0200] rev 39780
platform-sensitive contrib paths for ghc, ocaml
Wed, 29 Sep 2010 09:08:01 +0200 fact listsum now names listsum_foldl
haftmann [Wed, 29 Sep 2010 09:08:01 +0200] rev 39779
fact listsum now names listsum_foldl
Wed, 29 Sep 2010 09:08:00 +0200 delete code lemma explicitly
haftmann [Wed, 29 Sep 2010 09:08:00 +0200] rev 39778
delete code lemma explicitly
Wed, 29 Sep 2010 09:07:58 +0200 moved old_primrec source to nominal package, where it is still used
haftmann [Wed, 29 Sep 2010 09:07:58 +0200] rev 39777
moved old_primrec source to nominal package, where it is still used
Tue, 28 Sep 2010 15:39:59 +0200 dropped old primrec package
haftmann [Tue, 28 Sep 2010 15:39:59 +0200] rev 39776
dropped old primrec package
Tue, 28 Sep 2010 15:34:47 +0200 merged
haftmann [Tue, 28 Sep 2010 15:34:47 +0200] rev 39775
merged
Tue, 28 Sep 2010 15:21:45 +0200 localized listsum
haftmann [Tue, 28 Sep 2010 15:21:45 +0200] rev 39774
localized listsum
Tue, 28 Sep 2010 15:21:45 +0200 lemma listsum_conv_fold
haftmann [Tue, 28 Sep 2010 15:21:45 +0200] rev 39773
lemma listsum_conv_fold
Tue, 28 Sep 2010 15:34:30 +0200 merged
haftmann [Tue, 28 Sep 2010 15:34:30 +0200] rev 39772
merged
Tue, 28 Sep 2010 15:33:56 +0200 NEWS
haftmann [Tue, 28 Sep 2010 15:33:56 +0200] rev 39771
NEWS
Tue, 28 Sep 2010 15:32:59 +0200 dropped syntax for old primrec package
haftmann [Tue, 28 Sep 2010 15:32:59 +0200] rev 39770
dropped syntax for old primrec package
Tue, 28 Sep 2010 15:31:10 +0200 modernized session
haftmann [Tue, 28 Sep 2010 15:31:10 +0200] rev 39769
modernized session
Tue, 28 Sep 2010 13:44:06 +0200 merged
bulwahn [Tue, 28 Sep 2010 13:44:06 +0200] rev 39768
merged
Tue, 28 Sep 2010 11:59:58 +0200 using SUBPROOF to ensure that rewriting is not done on the further subgoals of proof
bulwahn [Tue, 28 Sep 2010 11:59:58 +0200] rev 39767
using SUBPROOF to ensure that rewriting is not done on the further subgoals of proof
Tue, 28 Sep 2010 11:59:57 +0200 avoiding instable rotate_tac and using the nice Subgoal.FOCUS_PREMS instead
bulwahn [Tue, 28 Sep 2010 11:59:57 +0200] rev 39766
avoiding instable rotate_tac and using the nice Subgoal.FOCUS_PREMS instead
Tue, 28 Sep 2010 11:59:53 +0200 adding test case for interpretation of arguments that are predicates simply as input
bulwahn [Tue, 28 Sep 2010 11:59:53 +0200] rev 39765
adding test case for interpretation of arguments that are predicates simply as input
Tue, 28 Sep 2010 11:59:52 +0200 only modes but not types are used to destruct terms and types; this allows to interpret arguments that are predicates simply as input
bulwahn [Tue, 28 Sep 2010 11:59:52 +0200] rev 39764
only modes but not types are used to destruct terms and types; this allows to interpret arguments that are predicates simply as input
Tue, 28 Sep 2010 11:59:51 +0200 weakening check for higher-order relations, but adding check for consistent modes
bulwahn [Tue, 28 Sep 2010 11:59:51 +0200] rev 39763
weakening check for higher-order relations, but adding check for consistent modes
Tue, 28 Sep 2010 11:59:51 +0200 handling higher-order relations in output terms; improving proof procedure; added test case
bulwahn [Tue, 28 Sep 2010 11:59:51 +0200] rev 39762
handling higher-order relations in output terms; improving proof procedure; added test case
Tue, 28 Sep 2010 11:59:50 +0200 renaming use_random to use_generators in the predicate compiler
bulwahn [Tue, 28 Sep 2010 11:59:50 +0200] rev 39761
renaming use_random to use_generators in the predicate compiler
Tue, 28 Sep 2010 11:59:48 +0200 fixed a typo that caused the preference of non-random modes to be ignored
bulwahn [Tue, 28 Sep 2010 11:59:48 +0200] rev 39760
fixed a typo that caused the preference of non-random modes to be ignored
Tue, 28 Sep 2010 12:48:05 +0200 merged
haftmann [Tue, 28 Sep 2010 12:48:05 +0200] rev 39759
merged
Tue, 28 Sep 2010 12:47:55 +0200 modernized primrecs
haftmann [Tue, 28 Sep 2010 12:47:55 +0200] rev 39758
modernized primrecs
Tue, 28 Sep 2010 12:47:55 +0200 modernized session
haftmann [Tue, 28 Sep 2010 12:47:55 +0200] rev 39757
modernized session
Tue, 28 Sep 2010 12:34:41 +0200 consolidated tupled_lambda; moved to structure HOLogic
krauss [Tue, 28 Sep 2010 12:34:41 +0200] rev 39756
consolidated tupled_lambda; moved to structure HOLogic
Tue, 28 Sep 2010 12:10:37 +0200 added dependency to base image to ensure that the doc test actually rebuilds the tutorial
haftmann [Tue, 28 Sep 2010 12:10:37 +0200] rev 39755
added dependency to base image to ensure that the doc test actually rebuilds the tutorial
(0) -30000 -10000 -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 +30000 tip