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.
Wed, 24 Feb 2010 11:28:34 +0100 Cezary Kaliszyk Respects of permute and constructors.
Wed, 24 Feb 2010 11:03:30 +0100 Cezary Kaliszyk Generate fv_rsp automatically.
Wed, 24 Feb 2010 10:59:31 +0100 Cezary Kaliszyk Define the constants automatically.
Wed, 24 Feb 2010 10:47:41 +0100 Cezary Kaliszyk Rename also the lifted types to non-capital.
Wed, 24 Feb 2010 10:44:38 +0100 Cezary Kaliszyk Use the infrastructure in LF. Much shorter :).
(0) -1000 -300 -100 -15 +15 +100 +300 +1000 tip