Nominal/Fv.thy
Sun, 04 Apr 2010 21:39:28 +0200 Christian Urban separated general nominal theory into separate folder
Thu, 01 Apr 2010 08:48:33 +0200 Cezary Kaliszyk Let with multiple bindings.
Sat, 27 Mar 2010 16:20:39 +0100 Cezary Kaliszyk Lets finally abstract lists.
Sat, 27 Mar 2010 12:26:59 +0100 Cezary Kaliszyk Equivariance when bn functions are lists.
Sat, 27 Mar 2010 12:20:17 +0100 Cezary Kaliszyk Accepts lists in FV.
Sat, 27 Mar 2010 09:56:35 +0100 Cezary Kaliszyk Automatically compute support if only one type of Abs is present in the type.
Sat, 27 Mar 2010 09:41:00 +0100 Cezary Kaliszyk Manually proved TySch support; All properties of TySch now true.
Sat, 27 Mar 2010 09:21:43 +0100 Cezary Kaliszyk Generalize Abs_eq_iff.
Sat, 27 Mar 2010 08:42:07 +0100 Cezary Kaliszyk New compose lemmas. Reverted alpha_gen sym/trans changes. Equivp for alpha_res should work now.
Sat, 27 Mar 2010 08:17:43 +0100 Cezary Kaliszyk Initial proof modifications for alpha_res
Sat, 27 Mar 2010 08:11:11 +0100 Cezary Kaliszyk Fv/Alpha now takes into account Alpha_Type given from the parser.
Sat, 27 Mar 2010 06:51:13 +0100 Cezary Kaliszyk Minor cleaning.
Fri, 26 Mar 2010 17:01:22 +0100 Cezary Kaliszyk Fixed renamings.
Fri, 26 Mar 2010 16:20:39 +0100 Cezary Kaliszyk Removed remaining cheats + some cleaning.
Fri, 26 Mar 2010 10:07:26 +0100 Cezary Kaliszyk Removed another cheat and cleaned the code a bit.
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.
Wed, 24 Mar 2010 11:13:39 +0100 Cezary Kaliszyk Support proof modification for Core Haskell.
Wed, 24 Mar 2010 09:59:47 +0100 Cezary Kaliszyk Compute Fv for non-recursive bn functions calling other bn functions
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 11:42:06 +0100 Cezary Kaliszyk Modification to Core Haskell to make it accepted with an empty binding function.
Mon, 22 Mar 2010 18:29:29 +0100 Cezary Kaliszyk equivp_cheat can be removed for all one-permutation examples.
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.
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 14:54:30 +0100 Cezary Kaliszyk Use fs typeclass in showing finite support + some cheat cleaning.
Fri, 19 Mar 2010 08:31:43 +0100 Cezary Kaliszyk The nominal infrastructure for fset. 'fs' missing, but not needed so far.
Thu, 18 Mar 2010 15:32:49 +0100 Cezary Kaliszyk Continued description of alpha.
Thu, 18 Mar 2010 14:48:27 +0100 Cezary Kaliszyk First part of the description of alpha_ty.
Thu, 18 Mar 2010 14:29:42 +0100 Cezary Kaliszyk Description of generation of alpha_bn.
Thu, 18 Mar 2010 12:09:59 +0100 Cezary Kaliszyk Added fv,bn,distinct,perm to the simplifier.
Thu, 18 Mar 2010 11:36:03 +0100 Cezary Kaliszyk Simplified the description.
Thu, 18 Mar 2010 11:29:12 +0100 Cezary Kaliszyk Update the description of the generation of fv function.
Thu, 18 Mar 2010 08:32:55 +0100 Cezary Kaliszyk Rename bound variables + minor cleaning.
Wed, 17 Mar 2010 17:40:14 +0100 Cezary Kaliszyk Proper compose_sym2
Wed, 17 Mar 2010 17:09:01 +0100 Cezary Kaliszyk Trying to find a compose lemma for 2 arguments.
Wed, 17 Mar 2010 12:18:35 +0100 Cezary Kaliszyk cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Wed, 17 Mar 2010 09:57:54 +0100 Cezary Kaliszyk Fix in alpha; support of the recursive Let works :)
Wed, 17 Mar 2010 09:17:55 +0100 Cezary Kaliszyk Generate compound FV and Alpha for recursive bindings.
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:18:08 +0100 Cezary Kaliszyk The old recursive alpha works fine.
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 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:06:22 +0100 Cezary Kaliszyk Removed pi o bn = bn' assumption in alpha
Thu, 11 Mar 2010 20:49:31 +0100 Cezary Kaliszyk Do not fail if the finite support proof fails.
Thu, 11 Mar 2010 17:47:29 +0100 Cezary Kaliszyk Show that the new types are in finite support typeclass.
Thu, 11 Mar 2010 16:50:44 +0100 Cezary Kaliszyk mk_supports_eq and supports_tac.
Thu, 11 Mar 2010 15:11:57 +0100 Cezary Kaliszyk Remove "_raw" from lifted theorems.
Thu, 11 Mar 2010 11:41:27 +0100 Cezary Kaliszyk Proper error message.
Thu, 11 Mar 2010 11:25:56 +0100 Cezary Kaliszyk Remove tracing from fv/alpha.
Wed, 10 Mar 2010 13:29:12 +0100 Cezary Kaliszyk Allows multiple bindings with same lhs.
Wed, 10 Mar 2010 12:53:30 +0100 Cezary Kaliszyk A minor fix for shallow binders. LF works again.
Wed, 10 Mar 2010 11:19:59 +0100 Cezary Kaliszyk Fv&Alpha seem to work.
Wed, 10 Mar 2010 10:47:21 +0100 Cezary Kaliszyk include alpha in the definitions.
Wed, 10 Mar 2010 10:11:20 +0100 Cezary Kaliszyk Filled the algorithm for alpha_bn_arg
Wed, 10 Mar 2010 09:58:43 +0100 Cezary Kaliszyk rhs of alpha_bn, and template for the arguments.
Wed, 10 Mar 2010 09:45:38 +0100 Cezary Kaliszyk alpha_bn_constr template
Wed, 10 Mar 2010 09:36:07 +0100 Cezary Kaliszyk exported template for alpha_bn
Wed, 10 Mar 2010 09:09:52 +0100 Cezary Kaliszyk Use alpha_bns in normal alpha defs.
Wed, 10 Mar 2010 08:44:19 +0100 Cezary Kaliszyk alpha_bn_frees
less more (0) -60 tip