Wed, 24 Feb 2010 15:36:07 +0100 Note the instance proofs, since they can be easily lifted.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 15:36:07 +0100] rev 1249
Note the instance proofs, since they can be easily lifted.
Wed, 24 Feb 2010 15:13:22 +0100 More refactoring and removed references to the global simpset in Perm.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 15:13:22 +0100] rev 1248
More refactoring and removed references to the global simpset in Perm.
Wed, 24 Feb 2010 14:55:09 +0100 Factor-out 'prove_perm_empty'; I plan to use it in defining permutations on the lifted type.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 14:55:09 +0100] rev 1247
Factor-out 'prove_perm_empty'; I plan to use it in defining permutations on the lifted type.
Wed, 24 Feb 2010 14:37:51 +0100 Regularize finite support proof for trm1
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 14:37:51 +0100] rev 1246
Regularize finite support proof for trm1
Wed, 24 Feb 2010 14:09:34 +0100 Made the fv-supp proof much more straightforward.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 14:09:34 +0100] rev 1245
Made the fv-supp proof much more straightforward.
Wed, 24 Feb 2010 12:06:55 +0100 Regularize the proofs about finite support.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 12:06:55 +0100] rev 1244
Regularize the proofs about finite support.
(0) -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 tip