Nominal/Parser.thy
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 10:49:50 +0100 Cezary Kaliszyk Export all the cheats needed for Core Haskell.
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 08:33:48 +0100 Cezary Kaliszyk Move examples which create more permutations out
Mon, 22 Mar 2010 18:29:29 +0100 Cezary Kaliszyk equivp_cheat can be removed for all one-permutation examples.
Mon, 22 Mar 2010 17:21:27 +0100 Cezary Kaliszyk Got rid of alpha_bn_rsp_cheat.
Mon, 22 Mar 2010 14:07:07 +0100 Cezary Kaliszyk fv_rsp proved automatically.
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: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 10:24:16 +0100 Cezary Kaliszyk Remove atom_decl from the parser.
Thu, 18 Mar 2010 23:19:55 +0100 Cezary Kaliszyk Reached strong_induction in fset-based TySch. Will not work until isabelle changes are pushed.
less more (0) -15 tip