Thu, 25 Feb 2010 07:48:33 +0100 Christian Urban moved Nominal to "toplevel"
Thu, 25 Feb 2010 07:05:52 +0100 Cezary Kaliszyk Export perm_frees.
Wed, 24 Feb 2010 23:25:30 +0100 Cezary Kaliszyk Restructuring the code in Perm
Wed, 24 Feb 2010 18:38:49 +0100 Cezary Kaliszyk Simplified and finised eqvt proofs for t1 and t5
Wed, 24 Feb 2010 17:42:52 +0100 Cezary Kaliszyk merge
Wed, 24 Feb 2010 17:42:37 +0100 Cezary Kaliszyk Define lifted perms.
Wed, 24 Feb 2010 17:32:43 +0100 Christian Urban merged
Wed, 24 Feb 2010 17:32:22 +0100 Christian Urban parsing and definition of raw datatype and bv-function work (not very beautiful)
Wed, 24 Feb 2010 15:39:17 +0100 Cezary Kaliszyk With permute_rsp we can lift the instance proofs :).
Wed, 24 Feb 2010 15:36:07 +0100 Cezary Kaliszyk Note the instance proofs, since they can be easily lifted.
Wed, 24 Feb 2010 15:13:22 +0100 Cezary Kaliszyk More refactoring and removed references to the global simpset in Perm.
Wed, 24 Feb 2010 14:55:09 +0100 Cezary Kaliszyk 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 Cezary Kaliszyk Regularize finite support proof for trm1
Wed, 24 Feb 2010 14:09:34 +0100 Cezary Kaliszyk Made the fv-supp proof much more straightforward.
Wed, 24 Feb 2010 12:06:55 +0100 Cezary Kaliszyk Regularize the proofs about finite support.
(0) -1000 -300 -100 -15 +15 +100 +300 +1000 tip