Wed, 21 Apr 2010 21:29:09 +0200 moved some lemmas into the right places
Christian Urban <urbanc@in.tum.de> [Wed, 21 Apr 2010 21:29:09 +0200] rev 1930
moved some lemmas into the right places
Wed, 21 Apr 2010 20:01:18 +0200 minor
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 21 Apr 2010 20:01:18 +0200] rev 1929
minor
Wed, 21 Apr 2010 19:11:51 +0200 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 21 Apr 2010 19:11:51 +0200] rev 1928
merge
Wed, 21 Apr 2010 19:10:55 +0200 append_rsp2 + isarification
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 21 Apr 2010 19:10:55 +0200] rev 1927
append_rsp2 + isarification
Wed, 21 Apr 2010 17:42:57 +0200 some small changes
Christian Urban <urbanc@in.tum.de> [Wed, 21 Apr 2010 17:42:57 +0200] rev 1926
some small changes
Wed, 21 Apr 2010 16:25:24 +0200 merged
Christian Urban <urbanc@in.tum.de> [Wed, 21 Apr 2010 16:25:24 +0200] rev 1925
merged
Wed, 21 Apr 2010 16:25:00 +0200 deleted the incomplete proof about pairs of abstractions
Christian Urban <urbanc@in.tum.de> [Wed, 21 Apr 2010 16:25:00 +0200] rev 1924
deleted the incomplete proof about pairs of abstractions
Wed, 21 Apr 2010 16:24:18 +0200 added a variant of the induction principle for permutations
Christian Urban <urbanc@in.tum.de> [Wed, 21 Apr 2010 16:24:18 +0200] rev 1923
added a variant of the induction principle for permutations
Wed, 21 Apr 2010 13:39:34 +0200 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 21 Apr 2010 13:39:34 +0200] rev 1922
merge
Wed, 21 Apr 2010 13:38:37 +0200 More about concat
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 21 Apr 2010 13:38:37 +0200] rev 1921
More about concat
Wed, 21 Apr 2010 12:38:20 +0200 merged
Christian Urban <urbanc@in.tum.de> [Wed, 21 Apr 2010 12:38:20 +0200] rev 1920
merged
Wed, 21 Apr 2010 12:37:44 +0200 incomplete tests
Christian Urban <urbanc@in.tum.de> [Wed, 21 Apr 2010 12:37:44 +0200] rev 1919
incomplete tests
Wed, 21 Apr 2010 12:37:19 +0200 added an improved version of the induction principle for permutations
Christian Urban <urbanc@in.tum.de> [Wed, 21 Apr 2010 12:37:19 +0200] rev 1918
added an improved version of the induction principle for permutations
Wed, 21 Apr 2010 10:34:10 +0200 Working lifting of concat with inline proofs of second level preservation.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 21 Apr 2010 10:34:10 +0200] rev 1917
Working lifting of concat with inline proofs of second level preservation.
Wed, 21 Apr 2010 10:24:39 +0200 FSet3 cleaning part2
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 21 Apr 2010 10:24:39 +0200] rev 1916
FSet3 cleaning part2
Wed, 21 Apr 2010 10:20:48 +0200 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 21 Apr 2010 10:20:48 +0200] rev 1915
merge
Wed, 21 Apr 2010 10:13:17 +0200 Remove the part already in FSet and leave the experiments
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 21 Apr 2010 10:13:17 +0200] rev 1914
Remove the part already in FSet and leave the experiments
Wed, 21 Apr 2010 10:09:07 +0200 merged
Christian Urban <urbanc@in.tum.de> [Wed, 21 Apr 2010 10:09:07 +0200] rev 1913
merged
Wed, 21 Apr 2010 10:08:47 +0200 removed a sorry
Christian Urban <urbanc@in.tum.de> [Wed, 21 Apr 2010 10:08:47 +0200] rev 1912
removed a sorry
Tue, 20 Apr 2010 18:24:50 +0200 renamed Ex1.thy to SingleLet.thy
Christian Urban <urbanc@in.tum.de> [Tue, 20 Apr 2010 18:24:50 +0200] rev 1911
renamed Ex1.thy to SingleLet.thy
Tue, 20 Apr 2010 11:29:00 +0200 tuning of the code
Christian Urban <urbanc@in.tum.de> [Tue, 20 Apr 2010 11:29:00 +0200] rev 1910
tuning of the code
Wed, 21 Apr 2010 09:48:35 +0200 Reorder FSet
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 21 Apr 2010 09:48:35 +0200] rev 1909
Reorder FSet
Wed, 21 Apr 2010 09:13:55 +0200 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 21 Apr 2010 09:13:55 +0200] rev 1908
merge
Wed, 21 Apr 2010 09:13:32 +0200 lattice properties.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 21 Apr 2010 09:13:32 +0200] rev 1907
lattice properties.
Tue, 20 Apr 2010 17:25:31 +0200 All lifted in Term4. Requires new isabelle.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 20 Apr 2010 17:25:31 +0200] rev 1906
All lifted in Term4. Requires new isabelle.
Tue, 20 Apr 2010 15:59:57 +0200 fsets are distributive lattices.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 20 Apr 2010 15:59:57 +0200] rev 1905
fsets are distributive lattices.
Tue, 20 Apr 2010 10:23:39 +0200 Fix of comment
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 20 Apr 2010 10:23:39 +0200] rev 1904
Fix of comment
Tue, 20 Apr 2010 09:13:52 +0200 reordered code
Christian Urban <urbanc@in.tum.de> [Tue, 20 Apr 2010 09:13:52 +0200] rev 1903
reordered code
Tue, 20 Apr 2010 09:02:22 +0200 renamed "_empty" and "_append" to "_zero" and "_plus"
Christian Urban <urbanc@in.tum.de> [Tue, 20 Apr 2010 09:02:22 +0200] rev 1902
renamed "_empty" and "_append" to "_zero" and "_plus"
Tue, 20 Apr 2010 08:57:13 +0200 removed dead code (nominal cannot deal with argument types of constructors that are functions)
Christian Urban <urbanc@in.tum.de> [Tue, 20 Apr 2010 08:57:13 +0200] rev 1901
removed dead code (nominal cannot deal with argument types of constructors that are functions)
(0) -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 tip