| Thu, 10 Dec 2009 04:23:13 +0100 |
Christian Urban |
moved the interpretation code into Unused.thy
|
file |
diff |
annotate
|
| Thu, 10 Dec 2009 03:47:10 +0100 |
Christian Urban |
removed memb and used standard mem (member from List.thy)
|
file |
diff |
annotate
|
| Thu, 10 Dec 2009 03:11:19 +0100 |
Christian Urban |
simplified proofs
|
file |
diff |
annotate
|
| Thu, 10 Dec 2009 02:46:08 +0100 |
Christian Urban |
removed quot_respect attribute of a non-standard lemma
|
file |
diff |
annotate
|
| Wed, 09 Dec 2009 15:59:02 +0100 |
Cezary Kaliszyk |
merge
|
file |
diff |
annotate
|
| Wed, 09 Dec 2009 15:57:47 +0100 |
Cezary Kaliszyk |
Different syntax for definitions that allows overloading and retrieving of definitions by matching whole constants.
|
file |
diff |
annotate
|
| Wed, 09 Dec 2009 15:11:49 +0100 |
Christian Urban |
improved fun_map_conv
|
file |
diff |
annotate
|
| Wed, 09 Dec 2009 05:59:49 +0100 |
Cezary Kaliszyk |
Temporarily repeated fun_map_tac 4 times. Cleaning for all examples work.
|
file |
diff |
annotate
|
| Wed, 09 Dec 2009 00:03:18 +0100 |
Christian Urban |
tuned the examples and flagged the problematic cleaning lemmas in FSet
|
file |
diff |
annotate
|
| Tue, 08 Dec 2009 23:32:54 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Tue, 08 Dec 2009 23:30:47 +0100 |
Christian Urban |
implemented cleaning strategy with fun_map.simps on non-bounded variables; still a few rough edges
|
file |
diff |
annotate
|
| Tue, 08 Dec 2009 23:04:25 +0100 |
Cezary Kaliszyk |
manually cleaned the hard lemma.
|
file |
diff |
annotate
|
| Tue, 08 Dec 2009 22:03:34 +0100 |
Cezary Kaliszyk |
An example which is hard to lift because of the interplay between lambda_prs and unfolding.
|
file |
diff |
annotate
|
| Tue, 08 Dec 2009 17:43:32 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Tue, 08 Dec 2009 17:40:58 +0100 |
Christian Urban |
added preserve rules to the cleaning_tac
|
file |
diff |
annotate
|