Nominal/Fv.thy
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.
less more (0) -15 tip