Wed, 24 Feb 2010 17:42:37 +0100 Define lifted perms.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 17:42:37 +0100] rev 1253
Define lifted perms.
Wed, 24 Feb 2010 17:32:43 +0100 merged
Christian Urban <urbanc@in.tum.de> [Wed, 24 Feb 2010 17:32:43 +0100] rev 1252
merged
Wed, 24 Feb 2010 17:32:22 +0100 parsing and definition of raw datatype and bv-function work (not very beautiful)
Christian Urban <urbanc@in.tum.de> [Wed, 24 Feb 2010 17:32:22 +0100] rev 1251
parsing and definition of raw datatype and bv-function work (not very beautiful)
Wed, 24 Feb 2010 15:39:17 +0100 With permute_rsp we can lift the instance proofs :).
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 15:39:17 +0100] rev 1250
With permute_rsp we can lift the instance proofs :).
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.
(0) -1000 -300 -100 -30 -10 -7 +7 +10 +30 +100 +300 +1000 tip