Wed, 29 Sep 2010 07:39:06 -0400 merged
Christian Urban <urbanc@in.tum.de> [Wed, 29 Sep 2010 07:39:06 -0400] rev 2499
merged
Wed, 29 Sep 2010 06:45:01 -0400 use also induct_schema for the Let-example (permute_bn is used)
Christian Urban <urbanc@in.tum.de> [Wed, 29 Sep 2010 06:45:01 -0400] rev 2498
use also induct_schema for the Let-example (permute_bn is used)
Wed, 29 Sep 2010 04:42:37 -0400 test with induct_schema for simpler strong_ind proofs
Christian Urban <urbanc@in.tum.de> [Wed, 29 Sep 2010 04:42:37 -0400] rev 2497
test with induct_schema for simpler strong_ind proofs
Wed, 29 Sep 2010 16:36:31 +0900 substitution definition with 'next_name'.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 29 Sep 2010 16:36:31 +0900] rev 2496
substitution definition with 'next_name'.
Tue, 28 Sep 2010 08:21:47 -0400 merged
Christian Urban <urbanc@in.tum.de> [Tue, 28 Sep 2010 08:21:47 -0400] rev 2495
merged
Tue, 28 Sep 2010 05:56:11 -0400 added Foo1 to explore a contrived example
Christian Urban <urbanc@in.tum.de> [Tue, 28 Sep 2010 05:56:11 -0400] rev 2494
added Foo1 to explore a contrived example
Mon, 27 Sep 2010 12:19:17 -0400 added postprocessed fresh-lemmas for constructors
Christian Urban <urbanc@in.tum.de> [Mon, 27 Sep 2010 12:19:17 -0400] rev 2493
added postprocessed fresh-lemmas for constructors
Mon, 27 Sep 2010 09:51:15 -0400 post-processed eq_iff and supp threormes according to the fv-supp equality
Christian Urban <urbanc@in.tum.de> [Mon, 27 Sep 2010 09:51:15 -0400] rev 2492
post-processed eq_iff and supp threormes according to the fv-supp equality
Mon, 27 Sep 2010 04:56:49 -0400 more consistent naming in Abs.thy
Christian Urban <urbanc@in.tum.de> [Mon, 27 Sep 2010 04:56:49 -0400] rev 2491
more consistent naming in Abs.thy
Mon, 27 Sep 2010 04:56:28 -0400 some experiments
Christian Urban <urbanc@in.tum.de> [Mon, 27 Sep 2010 04:56:28 -0400] rev 2490
some experiments
(0) -1000 -300 -100 -10 +10 +100 +300 tip