Nominal/Ex/CoreHaskell.thy
2010-12-28 Christian Urban automated all strong induction lemmas
2010-12-28 Christian Urban proper application of induction_schema and strong_exhaust rules; needs local fix in induction_schema.ML
2010-12-07 Christian Urban automated permute_bn theorems
2010-12-06 Christian Urban ordered raw_bn_info to agree with the order of the raw_bn_functions; started alpha_bn proof
2010-09-22 Christian Urban made supp proofs more robust by not using the standard induction; renamed some example files
2010-09-20 Christian Urban introduced a general procedure for structural inductions; simplified reflexivity proof
2010-08-29 Christian Urban renamed NewParser to Nominal2
2010-08-25 Christian Urban cleaned up (almost completely) the examples
2010-08-25 Christian Urban automatic lifting
2010-08-25 Christian Urban now every lemma lifts (even with type variables)
2010-08-22 Christian Urban updated to new Isabelle
2010-08-22 Christian Urban updated to new Isabelle
2010-08-21 Christian Urban changed parser so that the binding mode is indicated as "bind (list)", "bind (set)" or "bind (res)"; if only "bind" is given, then bind (list) is assumed as default
2010-08-17 Christian Urban improved runtime slightly, by constructing an explicit size measure for the function definitions
2010-08-16 Christian Urban can also lift the various eqvt lemmas for bn, fv, fv_bn and size
2010-08-16 Christian Urban also able to lift the bn_defs
2010-08-16 Christian Urban added rsp-lemmas for alpha_bns
2010-08-15 Christian Urban defined qperms and qsizes
2010-08-15 Christian Urban simplified code
2010-08-14 Christian Urban improved code
2010-08-11 Christian Urban added a function that transforms the helper-rsp lemmas into real rsp lemmas
2010-06-28 Christian Urban more quotient-definitions
2010-06-24 Christian Urban added definition of the quotient types
2010-06-22 Christian Urban proved eqvip theorems for alphas
2010-06-22 Christian Urban prove that alpha implies alpha_bn (needed for rsp proofs)
2010-06-11 Christian Urban also symmetry
2010-06-10 Christian Urban premerge
2010-06-09 Christian Urban transitivity proofs done
2010-06-07 Christian Urban merged
2010-06-07 Christian Urban work on transitivity proof
2010-06-03 Christian Urban fixed problem with eqvt proofs
2010-06-02 Christian Urban fixed problem with bn_info
2010-06-07 Christian Urban improved abstract, some tuning
2010-05-16 Christian Urban moved the exporting part into the parser (this is still a hack); re-added CoreHaskell again to the examples - there seems to be a problem with the variable name pat
2010-05-12 Christian Urban fixed the examples for the new eqvt-procedure....temporarily disabled Manual/Term4.thy
2010-05-11 Cezary Kaliszyk Include raw permutation definitions in eqvt
2010-05-11 Cezary Kaliszyk Declare alpha_gen_eqvt as eqvt and change the proofs that used 'eqvts[symmetric]'
2010-05-10 Christian Urban added comment about bind_set
2010-05-10 Cezary Kaliszyk Restore set bindings in CoreHaskell
2010-05-09 Christian Urban tuned file names for examples
less more (0) tip