Christian Urban <urbanc@in.tum.de> [Fri, 25 Sep 2009 17:08:50 +0200] rev 39
fixed a bug in my code: function typedef_term constructs now now the correct term when the relation is called x
Christian Urban <urbanc@in.tum.de> [Fri, 25 Sep 2009 16:50:11 +0200] rev 38
tuned slightly one proof
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 25 Sep 2009 14:50:35 +0200] rev 37
A version of the tactic that exports variables correctly.
It still does not know how to instantiate the obtained theorems.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 25 Sep 2009 09:38:16 +0200] rev 36
Minor cleaning: whitespace, commas etc.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 24 Sep 2009 17:43:26 +0200] rev 35
Correctly handling abstractions while building goals
Use DatatypeAux cong_tac instead of own functions since
it handles universal quantifiers properly.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 24 Sep 2009 13:32:52 +0200] rev 34
Minor cleanup
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 24 Sep 2009 11:38:20 +0200] rev 33
Found the source for the exception and added a handle for it.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 24 Sep 2009 09:09:46 +0200] rev 32
Make the tactic use Trueprop_cong and atomize.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 23 Sep 2009 16:57:56 +0200] rev 31
Proper code for getting the prop out of the theorem.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 23 Sep 2009 16:44:56 +0200] rev 30
Using "atomize" the versions with arbitrary Trueprops can be proven.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 22 Sep 2009 17:39:52 +0200] rev 29
Proper definition of CARD and some properties of it.
Translation should now support Pure assumptions and Trueprops anywhere,
but a problem needs to be fixed with the tactic.
Christian Urban <urbanc@in.tum.de> [Tue, 22 Sep 2009 09:42:27 +0200] rev 28
some comments
Christian Urban <urbanc@in.tum.de> [Mon, 21 Sep 2009 18:18:29 +0200] rev 27
merged
Christian Urban <urbanc@in.tum.de> [Mon, 21 Sep 2009 18:18:01 +0200] rev 26
slight tuning
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 21 Sep 2009 16:45:44 +0200] rev 25
The tactic with REPEAT, CHANGED and a proper simpset.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 21 Sep 2009 10:53:01 +0200] rev 24
Merged with my changes from the morning:
further working on the tactic and produced goals.
Ning@localhost [Sun, 20 Sep 2009 05:48:49 +0100] rev 23
some more beautification
Ning@localhost [Sun, 20 Sep 2009 05:18:36 +0100] rev 22
beautification of some proofs
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 18 Sep 2009 17:30:33 +0200] rev 21
Added more useful quotient facts.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 18 Sep 2009 13:44:06 +0200] rev 20
Testing the tactic further.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 17 Sep 2009 16:55:11 +0200] rev 19
The tactic still only for fset
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 17 Sep 2009 12:06:06 +0200] rev 18
Infrastructure for the tactic
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 16 Sep 2009 11:50:41 +0200] rev 17
More naming/binding suggestions from Makarius
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 15 Sep 2009 11:31:35 +0200] rev 16
Code cleanup
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 15 Sep 2009 10:00:34 +0200] rev 15
Cleaning the code
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 15 Sep 2009 09:59:56 +0200] rev 14
Generalized interpretation, works for all examples.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 28 Aug 2009 17:12:19 +0200] rev 13
Fixes after suggestions from Makarius:
- indentation
- lowercase/uppercase
- axioms -> axiomatization
- proper operator priorities
- proper exception handling
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 28 Aug 2009 10:01:25 +0200] rev 12
More examples.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 27 Aug 2009 09:04:39 +0200] rev 11
Use metavariables in the 'non-lambda' definitions
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 26 Aug 2009 11:31:55 +0200] rev 10
Make both kinds of definitions.