Mon, 12 Oct 2009 23:39:14 +0200 slightly modified the parser
Christian Urban <urbanc@in.tum.de> [Mon, 12 Oct 2009 23:39:14 +0200] rev 81
slightly modified the parser
Mon, 12 Oct 2009 23:16:20 +0200 deleted diagnostic code
Christian Urban <urbanc@in.tum.de> [Mon, 12 Oct 2009 23:16:20 +0200] rev 80
deleted diagnostic code
Mon, 12 Oct 2009 23:06:14 +0200 added quotient command (you need to update isar-keywords-prove.el)
Christian Urban <urbanc@in.tum.de> [Mon, 12 Oct 2009 23:06:14 +0200] rev 79
added quotient command (you need to update isar-keywords-prove.el)
Mon, 12 Oct 2009 22:44:16 +0200 added new keyword
Christian Urban <urbanc@in.tum.de> [Mon, 12 Oct 2009 22:44:16 +0200] rev 78
added new keyword
Mon, 12 Oct 2009 16:31:29 +0200 Bounded quantifier
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 12 Oct 2009 16:31:29 +0200] rev 77
Bounded quantifier
Mon, 12 Oct 2009 15:47:27 +0200 The tyREL function.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 12 Oct 2009 15:47:27 +0200] rev 76
The tyREL function.
Mon, 12 Oct 2009 14:30:50 +0200 started some strange functions
Christian Urban <urbanc@in.tum.de> [Mon, 12 Oct 2009 14:30:50 +0200] rev 75
started some strange functions
Mon, 12 Oct 2009 13:58:31 +0200 Further with the manual proof
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 12 Oct 2009 13:58:31 +0200] rev 74
Further with the manual proof
Fri, 09 Oct 2009 17:05:45 +0200 Further experiments with proving induction manually
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 09 Oct 2009 17:05:45 +0200] rev 73
Further experiments with proving induction manually
Fri, 09 Oct 2009 15:03:43 +0200 Testing if I can prove the regularized version of induction manually
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 09 Oct 2009 15:03:43 +0200] rev 72
Testing if I can prove the regularized version of induction manually
Thu, 08 Oct 2009 14:27:50 +0200 exported parts of QuotMain into a separate ML-file
Christian Urban <urbanc@in.tum.de> [Thu, 08 Oct 2009 14:27:50 +0200] rev 71
exported parts of QuotMain into a separate ML-file
Tue, 06 Oct 2009 15:11:30 +0200 consistent usage of rty (for the raw, unquotient type); tuned a bit the Isar
Christian Urban <urbanc@in.tum.de> [Tue, 06 Oct 2009 15:11:30 +0200] rev 70
consistent usage of rty (for the raw, unquotient type); tuned a bit the Isar proof of atomize_eqv.
Tue, 06 Oct 2009 11:56:23 +0200 simplified typedef_quot_type_tac (using MetaSimplifier.rewrite_rule instead of the simplifier)
Christian Urban <urbanc@in.tum.de> [Tue, 06 Oct 2009 11:56:23 +0200] rev 69
simplified typedef_quot_type_tac (using MetaSimplifier.rewrite_rule instead of the simplifier)
Tue, 06 Oct 2009 11:41:35 +0200 renamed unlam_def to unabs_def (matching the function abs_def in drule.ML)
Christian Urban <urbanc@in.tum.de> [Tue, 06 Oct 2009 11:41:35 +0200] rev 68
renamed unlam_def to unabs_def (matching the function abs_def in drule.ML)
Tue, 06 Oct 2009 11:36:08 +0200 tuned; nothing serious
Christian Urban <urbanc@in.tum.de> [Tue, 06 Oct 2009 11:36:08 +0200] rev 67
tuned; nothing serious
Tue, 06 Oct 2009 09:28:59 +0200 another improvement to unlam_def
Christian Urban <urbanc@in.tum.de> [Tue, 06 Oct 2009 09:28:59 +0200] rev 66
another improvement to unlam_def
Tue, 06 Oct 2009 02:02:51 +0200 one further improvement to unlam_def
Christian Urban <urbanc@in.tum.de> [Tue, 06 Oct 2009 02:02:51 +0200] rev 65
one further improvement to unlam_def
Tue, 06 Oct 2009 01:50:13 +0200 simplified the unlam_def function
Christian Urban <urbanc@in.tum.de> [Tue, 06 Oct 2009 01:50:13 +0200] rev 64
simplified the unlam_def function
Mon, 05 Oct 2009 11:54:02 +0200 added an explicit syntax-argument to the function make_def (is needed if the user gives an syntax annotation for quotient types)
Christian Urban <urbanc@in.tum.de> [Mon, 05 Oct 2009 11:54:02 +0200] rev 63
added an explicit syntax-argument to the function make_def (is needed if the user gives an syntax annotation for quotient types)
Mon, 05 Oct 2009 11:24:32 +0200 used prop_of to get the term of a theorem (replaces crep_thm)
Christian Urban <urbanc@in.tum.de> [Mon, 05 Oct 2009 11:24:32 +0200] rev 62
used prop_of to get the term of a theorem (replaces crep_thm)
Fri, 02 Oct 2009 11:10:21 +0200 Merged
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 02 Oct 2009 11:10:21 +0200] rev 61
Merged
Fri, 02 Oct 2009 11:09:33 +0200 First theorem with quantifiers. Learned how to use sledgehammer.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 02 Oct 2009 11:09:33 +0200] rev 60
First theorem with quantifiers. Learned how to use sledgehammer.
Thu, 01 Oct 2009 16:10:14 +0200 simplified the storage of the map-functions by using TheoryDataFun
Christian Urban <urbanc@in.tum.de> [Thu, 01 Oct 2009 16:10:14 +0200] rev 59
simplified the storage of the map-functions by using TheoryDataFun
Wed, 30 Sep 2009 16:57:09 +0200 Just one atomize is enough for the currently lifted theorems. Properly lift 'all' and 'Ex'.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 30 Sep 2009 16:57:09 +0200] rev 58
Just one atomize is enough for the currently lifted theorems. Properly lift 'all' and 'Ex'.
Tue, 29 Sep 2009 22:35:48 +0200 used new cong_tac
Christian Urban <urbanc@in.tum.de> [Tue, 29 Sep 2009 22:35:48 +0200] rev 57
used new cong_tac
Tue, 29 Sep 2009 17:46:18 +0200 First version of handling of the universal quantifier
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 29 Sep 2009 17:46:18 +0200] rev 56
First version of handling of the universal quantifier
Tue, 29 Sep 2009 15:58:14 +0200 Handling abstraction correctly.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 29 Sep 2009 15:58:14 +0200] rev 55
Handling abstraction correctly.
Tue, 29 Sep 2009 13:38:27 +0200 second test
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 29 Sep 2009 13:38:27 +0200] rev 54
second test
Tue, 29 Sep 2009 13:24:57 +0200 Test line
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 29 Sep 2009 13:24:57 +0200] rev 53
Test line
Tue, 29 Sep 2009 11:55:37 +0200 Partially fix lifting of card_suc. The quantified variable still needs to be changed.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 29 Sep 2009 11:55:37 +0200] rev 52
Partially fix lifting of card_suc. The quantified variable still needs to be changed.
(0) -50 -30 +30 +50 +100 +300 +1000 +3000 tip