Thu, 18 Mar 2010 11:29:12 +0100 Cezary Kaliszyk Update the description of the generation of fv function.
Thu, 18 Mar 2010 11:16:53 +0100 Cezary Kaliszyk fv_bn may need to call other fv_bns.
Thu, 18 Mar 2010 10:15:57 +0100 Cezary Kaliszyk Update TODO.
Thu, 18 Mar 2010 10:12:41 +0100 Cezary Kaliszyk Which proofs need a 'sorry'.
Thu, 18 Mar 2010 10:05:36 +0100 Christian Urban added TODO
Thu, 18 Mar 2010 10:02:21 +0100 Christian Urban vixed variable names
Thu, 18 Mar 2010 09:31:31 +0100 Christian Urban simplified strong induction proof by using flip
Thu, 18 Mar 2010 08:32:55 +0100 Cezary Kaliszyk Rename bound variables + minor cleaning.
Thu, 18 Mar 2010 08:03:42 +0100 Cezary Kaliszyk Move most of the exporting out of the parser.
Thu, 18 Mar 2010 07:43:44 +0100 Cezary Kaliszyk Prove pseudo-inject (eq-iff) on the exported level and rename appropriately.
Thu, 18 Mar 2010 07:35:44 +0100 Cezary Kaliszyk Prove eqvts on exported terms.
Thu, 18 Mar 2010 07:26:36 +0100 Cezary Kaliszyk Clean 'Lift', start working only on exported things in Parser.
Thu, 18 Mar 2010 00:17:21 +0100 Christian Urban slightly more of the paper
Wed, 17 Mar 2010 20:42:42 +0100 Christian Urban merged
Wed, 17 Mar 2010 20:42:22 +0100 Christian Urban paper uses now a heap file - does not compile so long anymore
Wed, 17 Mar 2010 18:53:23 +0100 Cezary Kaliszyk merge
Wed, 17 Mar 2010 18:52:59 +0100 Cezary Kaliszyk compose_sym2 works also for term5
Wed, 17 Mar 2010 17:59:04 +0100 Cezary Kaliszyk Updated Term1, including statement of strong induction.
Wed, 17 Mar 2010 17:40:14 +0100 Cezary Kaliszyk Proper compose_sym2
Wed, 17 Mar 2010 17:11:23 +0100 Christian Urban merged
Wed, 17 Mar 2010 17:10:19 +0100 Christian Urban temporarily disabled tests in Nominal/ROOT
Wed, 17 Mar 2010 15:13:31 +0100 Christian Urban made paper to compile
Wed, 17 Mar 2010 15:13:03 +0100 Christian Urban added partial proof for the strong induction principle
Wed, 17 Mar 2010 17:09:01 +0100 Cezary Kaliszyk Trying to find a compose lemma for 2 arguments.
Wed, 17 Mar 2010 12:23:04 +0100 Cezary Kaliszyk merge
Wed, 17 Mar 2010 12:18:35 +0100 Cezary Kaliszyk cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Wed, 17 Mar 2010 11:54:22 +0100 Christian Urban merged
Wed, 17 Mar 2010 11:53:56 +0100 Christian Urban added proof of supp/fv for type schemes
Wed, 17 Mar 2010 11:40:58 +0100 Cezary Kaliszyk Updated Type Schemes to automatic lifting. One goal is not true because of the restriction.
Wed, 17 Mar 2010 11:20:24 +0100 Cezary Kaliszyk Remove Term5a, since it is now identical to Term5.
Wed, 17 Mar 2010 11:11:42 +0100 Cezary Kaliszyk merge
Wed, 17 Mar 2010 11:11:25 +0100 Cezary Kaliszyk Finished all proofs in Term5 and Term5n.
Wed, 17 Mar 2010 10:34:25 +0100 Christian Urban added partial proof of supp for type schemes
Wed, 17 Mar 2010 09:57:54 +0100 Cezary Kaliszyk Fix in alpha; support of the recursive Let works :)
Wed, 17 Mar 2010 09:42:56 +0100 Cezary Kaliszyk The recursive supp just has one equation too much.
Wed, 17 Mar 2010 09:25:01 +0100 Cezary Kaliszyk Fix for the change of alpha_gen.
Wed, 17 Mar 2010 09:18:27 +0100 Cezary Kaliszyk merge
Wed, 17 Mar 2010 09:17:55 +0100 Cezary Kaliszyk Generate compound FV and Alpha for recursive bindings.
Wed, 17 Mar 2010 08:39:46 +0100 Cezary Kaliszyk Lifting theorems with compound fv and compound alpha.
Wed, 17 Mar 2010 08:07:25 +0100 Christian Urban commented out examples that should not work; but for example type-scheme example should work
Wed, 17 Mar 2010 06:49:33 +0100 Christian Urban added another supp-proof for the non-recursive case
Tue, 16 Mar 2010 20:07:13 +0100 Cezary Kaliszyk Revert 7c8cd6eae8e2, now all proofs in Term5 go through, both recursive and not.
Tue, 16 Mar 2010 18:19:00 +0100 Cezary Kaliszyk merge
Tue, 16 Mar 2010 18:18:08 +0100 Cezary Kaliszyk The old recursive alpha works fine.
Tue, 16 Mar 2010 18:13:34 +0100 Christian Urban added the final unfolded result
Tue, 16 Mar 2010 18:02:08 +0100 Christian Urban merge and proof of support for non-recursive case
Tue, 16 Mar 2010 17:20:46 +0100 Cezary Kaliszyk Added Term5 non-recursive. The bug is there only for the recursive case.
Tue, 16 Mar 2010 17:11:32 +0100 Cezary Kaliszyk Alpha is wrong.
Tue, 16 Mar 2010 16:51:06 +0100 Cezary Kaliszyk alpha_bn doesn't need the permutation in non-recursive case.
Tue, 16 Mar 2010 16:17:05 +0100 Cezary Kaliszyk alpha5_transp and equivp
Tue, 16 Mar 2010 15:38:14 +0100 Cezary Kaliszyk alpha5_symp proved.
Tue, 16 Mar 2010 15:27:47 +0100 Cezary Kaliszyk FV_bn generated for recursive functions as well, and used in main fv for bindings.
Tue, 16 Mar 2010 12:08:37 +0100 Cezary Kaliszyk The proof in 'Test' gets simpler.
Tue, 16 Mar 2010 12:06:22 +0100 Cezary Kaliszyk Removed pi o bn = bn' assumption in alpha
Mon, 15 Mar 2010 23:42:56 +0100 Christian Urban merged (confirmed to work with Isabelle from 6th March)
Mon, 15 Mar 2010 17:52:31 +0100 Christian Urban another synchronisation
Mon, 15 Mar 2010 17:51:35 +0100 Christian Urban proof for support when bn-function is present, but fb_function is empty
Mon, 15 Mar 2010 17:42:17 +0100 Cezary Kaliszyk fv_eqvt_cheat no longer needed.
Mon, 15 Mar 2010 14:32:05 +0100 Cezary Kaliszyk derive "inducts" from "induct" instead of lifting again is much faster.
Mon, 15 Mar 2010 13:56:17 +0100 Cezary Kaliszyk build_eqvts works with recursive case if proper induction rule is used.
(0) -1000 -300 -100 -60 +60 +100 +300 +1000 tip