Christian Urban <urbanc@in.tum.de> [Thu, 25 Feb 2010 07:48:33 +0100] rev 1258
moved Nominal to "toplevel"
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Feb 2010 07:05:52 +0100] rev 1257
Export perm_frees.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 23:25:30 +0100] rev 1256
Restructuring the code in Perm
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 18:38:49 +0100] rev 1255
Simplified and finised eqvt proofs for t1 and t5
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 17:42:52 +0100] rev 1254
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 17:42:37 +0100] rev 1253
Define lifted perms.
Christian Urban <urbanc@in.tum.de> [Wed, 24 Feb 2010 17:32:43 +0100] rev 1252
merged
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)
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 :).
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.
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.
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.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 14:37:51 +0100] rev 1246
Regularize finite support proof for trm1
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 14:09:34 +0100] rev 1245
Made the fv-supp proof much more straightforward.