Fri, 26 Mar 2010 10:07:26 +0100 Cezary Kaliszyk Removed another cheat and cleaned the code a bit.
Fri, 26 Mar 2010 09:23:23 +0100 Cezary Kaliszyk Fix Manual/LamEx for experiments.
Thu, 25 Mar 2010 20:12:57 +0100 Cezary Kaliszyk Proper bn_rsp, for bn functions calling each other.
Thu, 25 Mar 2010 17:30:46 +0100 Cezary Kaliszyk Gathering things to prove by induction together; removed cheat_bn_eqvt.
Thu, 25 Mar 2010 15:06:58 +0100 Cezary Kaliszyk Update TODO
Thu, 25 Mar 2010 14:31:51 +0100 Cezary Kaliszyk Showed ACons_subst.
Thu, 25 Mar 2010 14:24:06 +0100 Cezary Kaliszyk Only ACons_subst left to show.
Thu, 25 Mar 2010 12:04:38 +0100 Cezary Kaliszyk Solved all boring subgoals, and looking at properly defning permute_bv
Thu, 25 Mar 2010 11:29:54 +0100 Cezary Kaliszyk One more copy-and-paste in core-haskell.
Thu, 25 Mar 2010 11:16:25 +0100 Cezary Kaliszyk Properly defined permute_bn. No more sorry's in Let strong induction.
Thu, 25 Mar 2010 11:10:15 +0100 Cezary Kaliszyk Showed Let substitution.
Thu, 25 Mar 2010 11:01:22 +0100 Cezary Kaliszyk Only let substitution is left.
Thu, 25 Mar 2010 10:44:14 +0100 Cezary Kaliszyk further in the proof
Thu, 25 Mar 2010 10:25:33 +0100 Cezary Kaliszyk trying to prove the string induction for let.
Thu, 25 Mar 2010 09:08:42 +0100 Christian Urban added experiemental permute_bn
Thu, 25 Mar 2010 08:05:03 +0100 Christian Urban first attempt of strong induction for lets with assignments
Thu, 25 Mar 2010 07:21:41 +0100 Christian Urban more on the paper
Wed, 24 Mar 2010 19:50:42 +0100 Christian Urban more on the paper
Wed, 24 Mar 2010 18:02:33 +0100 Cezary Kaliszyk Further in the strong induction proof.
Wed, 24 Mar 2010 16:06:31 +0100 Cezary Kaliszyk Solved one of the strong-induction goals.
Wed, 24 Mar 2010 14:49:51 +0100 Cezary Kaliszyk avoiding for atom.
Wed, 24 Mar 2010 13:54:20 +0100 Cezary Kaliszyk Started proving strong induction.
Wed, 24 Mar 2010 12:36:58 +0100 Cezary Kaliszyk stating the strong induction; further.
Wed, 24 Mar 2010 12:05:38 +0100 Cezary Kaliszyk Working on stating induct.
Wed, 24 Mar 2010 12:53:39 +0100 Christian Urban some tuning; possible fix for strange paper generation
Wed, 24 Mar 2010 12:34:28 +0100 Christian Urban more on the paper
Wed, 24 Mar 2010 12:04:03 +0100 Cezary Kaliszyk merge
Wed, 24 Mar 2010 12:03:48 +0100 Cezary Kaliszyk Showed support of Core Haskell
Wed, 24 Mar 2010 11:13:39 +0100 Cezary Kaliszyk Support proof modification for Core Haskell.
Wed, 24 Mar 2010 10:55:59 +0100 Cezary Kaliszyk Experiments with Core Haskell support.
Wed, 24 Mar 2010 10:49:50 +0100 Cezary Kaliszyk Export all the cheats needed for Core Haskell.
Wed, 24 Mar 2010 09:59:47 +0100 Cezary Kaliszyk Compute Fv for non-recursive bn functions calling other bn functions
Wed, 24 Mar 2010 08:45:54 +0100 Cezary Kaliszyk Core Haskell experiments.
Wed, 24 Mar 2010 07:23:53 +0100 Christian Urban tuned paper
Tue, 23 Mar 2010 17:44:43 +0100 Christian Urban more of the paper
Tue, 23 Mar 2010 17:22:37 +0100 Christian Urban merged
Tue, 23 Mar 2010 17:22:19 +0100 Christian Urban more tuning in the paper
Tue, 23 Mar 2010 16:28:46 +0100 Cezary Kaliszyk merge
Tue, 23 Mar 2010 16:28:29 +0100 Cezary Kaliszyk Parsing bn functions that call other bn functions and transmitting this information to fv/alpha.
Tue, 23 Mar 2010 13:07:11 +0100 Christian Urban merged
Tue, 23 Mar 2010 13:07:02 +0100 Christian Urban more tuning
Tue, 23 Mar 2010 13:03:42 +0100 Christian Urban tuned paper
Tue, 23 Mar 2010 11:52:55 +0100 Christian Urban more on the paper
Tue, 23 Mar 2010 11:43:09 +0100 Cezary Kaliszyk merge
Tue, 23 Mar 2010 11:42:06 +0100 Cezary Kaliszyk Modification to Core Haskell to make it accepted with an empty binding function.
Tue, 23 Mar 2010 10:26:46 +0100 Christian Urban merged
Tue, 23 Mar 2010 10:24:12 +0100 Christian Urban tuned paper
Tue, 23 Mar 2010 09:56:29 +0100 Cezary Kaliszyk Initial list unfoldings in Core Haskell.
Tue, 23 Mar 2010 09:38:03 +0100 Cezary Kaliszyk compiles
Tue, 23 Mar 2010 09:34:32 +0100 Cezary Kaliszyk More modification needed for compilation
Tue, 23 Mar 2010 09:21:43 +0100 Cezary Kaliszyk Moved let properties from Term5 to ExLetRec.
Tue, 23 Mar 2010 09:13:17 +0100 Cezary Kaliszyk Move Let properties to ExLet
Tue, 23 Mar 2010 09:06:28 +0100 Cezary Kaliszyk Added missing file
Tue, 23 Mar 2010 09:05:23 +0100 Cezary Kaliszyk More reorganization.
Tue, 23 Mar 2010 08:51:43 +0100 Cezary Kaliszyk Move Leroy out of Test, rename accordingly.
Tue, 23 Mar 2010 08:46:44 +0100 Cezary Kaliszyk Term1 is identical to Example 3
Tue, 23 Mar 2010 08:45:08 +0100 Cezary Kaliszyk Move example3 out.
Tue, 23 Mar 2010 08:42:02 +0100 Cezary Kaliszyk Move Ex1 and Ex2 out of Test
Tue, 23 Mar 2010 08:33:48 +0100 Cezary Kaliszyk Move examples which create more permutations out
Tue, 23 Mar 2010 08:22:48 +0100 Cezary Kaliszyk Move LamEx out of Test.
Tue, 23 Mar 2010 08:20:13 +0100 Cezary Kaliszyk Move lambda examples to manual
Tue, 23 Mar 2010 08:19:33 +0100 Cezary Kaliszyk Move manual examples to a subdirectory.
Tue, 23 Mar 2010 08:16:39 +0100 Cezary Kaliszyk Removed compat tests.
Tue, 23 Mar 2010 08:11:39 +0100 Cezary Kaliszyk merge
Tue, 23 Mar 2010 08:11:11 +0100 Cezary Kaliszyk Move Non-respectful examples to NotRsp
Tue, 23 Mar 2010 07:43:20 +0100 Christian Urban merged
Tue, 23 Mar 2010 07:39:10 +0100 Christian Urban more on the paper
Tue, 23 Mar 2010 07:04:27 +0100 Cezary Kaliszyk Move the comment to appropriate place.
Tue, 23 Mar 2010 07:04:14 +0100 Cezary Kaliszyk Remove compose_eqvt
Mon, 22 Mar 2010 18:56:35 +0100 Cezary Kaliszyk sym proof with compose.
Mon, 22 Mar 2010 18:38:59 +0100 Cezary Kaliszyk Marked the place where a compose lemma applies.
Mon, 22 Mar 2010 18:29:57 +0100 Cezary Kaliszyk merge
Mon, 22 Mar 2010 18:29:29 +0100 Cezary Kaliszyk equivp_cheat can be removed for all one-permutation examples.
Mon, 22 Mar 2010 18:20:06 +0100 Christian Urban merged
Mon, 22 Mar 2010 18:19:13 +0100 Christian Urban more on the paper
Mon, 22 Mar 2010 16:22:28 +0100 Christian Urban merged
Mon, 22 Mar 2010 16:22:07 +0100 Christian Urban tuned paper
Mon, 22 Mar 2010 17:21:27 +0100 Cezary Kaliszyk Got rid of alpha_bn_rsp_cheat.
Mon, 22 Mar 2010 15:27:01 +0100 Cezary Kaliszyk alpha_bn_rsp_pre automatized.
Mon, 22 Mar 2010 14:07:35 +0100 Cezary Kaliszyk merge
Mon, 22 Mar 2010 14:07:07 +0100 Cezary Kaliszyk fv_rsp proved automatically.
Mon, 22 Mar 2010 11:55:29 +0100 Christian Urban more on the paper
Mon, 22 Mar 2010 10:21:14 +0100 Christian Urban merged
Mon, 22 Mar 2010 10:20:57 +0100 Christian Urban tuned paper
Mon, 22 Mar 2010 09:16:25 +0100 Christian Urban some tuning
Mon, 22 Mar 2010 10:15:46 +0100 Cezary Kaliszyk Strong induction for Type Schemes.
Mon, 22 Mar 2010 09:02:30 +0100 Cezary Kaliszyk Fixed missing colon.
Sun, 21 Mar 2010 22:27:08 +0100 Christian Urban tuned paper
Sat, 20 Mar 2010 18:16:26 +0100 Christian Urban merged
Sat, 20 Mar 2010 16:27:51 +0100 Christian Urban proved at_set_avoiding2 which is needed for strong induction principles
Sat, 20 Mar 2010 13:50:00 +0100 Christian Urban moved lemmas supp_perm_eq and exists_perm to Nominal2_Supp
Sat, 20 Mar 2010 10:12:09 +0100 Cezary Kaliszyk Size experiments.
Sat, 20 Mar 2010 09:27:28 +0100 Cezary Kaliszyk Use 'alpha_bn_refl' to get rid of one of the sorrys.
Sat, 20 Mar 2010 08:56:07 +0100 Cezary Kaliszyk Build alpha-->alphabn implications
Sat, 20 Mar 2010 08:04:59 +0100 Cezary Kaliszyk Prove reflp for all relations.
Sat, 20 Mar 2010 04:51:26 +0100 Christian Urban started cleaning up and introduced 3 versions of ~~gen
Sat, 20 Mar 2010 02:46:07 +0100 Christian Urban moved infinite_Un into mainstream Isabelle; moved permute_boolI/E lemmas
Fri, 19 Mar 2010 21:04:24 +0100 Christian Urban more work on the paper
Fri, 19 Mar 2010 18:56:13 +0100 Cezary Kaliszyk Described automatically created funs.
Fri, 19 Mar 2010 18:43:29 +0100 Cezary Kaliszyk merge
Fri, 19 Mar 2010 18:42:57 +0100 Cezary Kaliszyk Automatically derive support for datatypes with at-most one binding per constructor.
Fri, 19 Mar 2010 17:20:25 +0100 Christian Urban picture
Fri, 19 Mar 2010 15:43:59 +0100 Christian Urban merged
Fri, 19 Mar 2010 15:43:43 +0100 Christian Urban polished
Fri, 19 Mar 2010 15:01:01 +0100 Cezary Kaliszyk Update Test to use fset.
Fri, 19 Mar 2010 14:54:57 +0100 Cezary Kaliszyk merge
Fri, 19 Mar 2010 14:54:30 +0100 Cezary Kaliszyk Use fs typeclass in showing finite support + some cheat cleaning.
Fri, 19 Mar 2010 12:31:55 +0100 Christian Urban merged
Fri, 19 Mar 2010 12:31:17 +0100 Christian Urban more one the paper
Fri, 19 Mar 2010 12:28:35 +0100 Cezary Kaliszyk Keep only one copy of infinite_Un.
Fri, 19 Mar 2010 12:24:16 +0100 Cezary Kaliszyk Added a missing 'import'.
Fri, 19 Mar 2010 12:22:10 +0100 Cezary Kaliszyk Showed the instance: fset::(at) fs
Fri, 19 Mar 2010 10:24:49 +0100 Cezary Kaliszyk merge
Fri, 19 Mar 2010 10:24:16 +0100 Cezary Kaliszyk Remove atom_decl from the parser.
Fri, 19 Mar 2010 10:23:52 +0100 Cezary Kaliszyk TySch strong induction looks ok.
Fri, 19 Mar 2010 09:31:38 +0100 Cezary Kaliszyk Working on TySch strong induction.
Fri, 19 Mar 2010 09:03:10 +0100 Cezary Kaliszyk Something is wrong with the statement of strong induction for TySch, as the All case is trivial and Fun case unprovable...
Fri, 19 Mar 2010 09:40:57 +0100 Christian Urban merged
Fri, 19 Mar 2010 09:40:34 +0100 Christian Urban more tuning on the paper
Fri, 19 Mar 2010 08:31:43 +0100 Cezary Kaliszyk The nominal infrastructure for fset. 'fs' missing, but not needed so far.
(0) -1000 -120 +120 +1000 tip