Nominal/Ex/TypeSchemes.thy
2011-07-05 Christian Urban changed bind to binds in specifications; bind will cause trouble with Monad_Syntax
2011-06-22 Christian Urban deleted some dead code
2011-06-22 Christian Urban some rudimentary infrastructure for storing data about nominal datatypes
2011-06-16 Cezary Kaliszyk Fix
2011-06-16 Christian Urban all tests work again
2011-06-15 Cezary Kaliszyk TypeSchemes work with 'default'.
2011-06-14 Christian Urban fixed the problem when giving a complex default-term; the fundef lemmas in Nominal_Base were not general enough
2011-06-10 Cezary Kaliszyk Slightly modify fcb for list1 and put in common place.
2011-06-09 Cezary Kaliszyk abs_res_fcb will be enough to finish the multiple-recursive proof, if we have a working 'default'.
2011-06-09 Cezary Kaliszyk More experiments with 'default'
2011-06-08 Cezary Kaliszyk Issue with 'default'
2011-06-08 Christian Urban merged
2011-06-08 Christian Urban using the option "default" the function package allows one to give an explicit default value
2011-06-08 Cezary Kaliszyk Simpler proof of TypeSchemes/substs
2011-06-08 Cezary Kaliszyk Simplify fcb_res
2011-06-08 Cezary Kaliszyk FCB for res binding and simplified proof of subst for type schemes
2011-06-07 Christian Urban cleaned ups a bit the examples with the invariant framework; exported nominal_function_config datatype into separate structure and file
2011-06-02 Cezary Kaliszyk merge
2011-06-02 Cezary Kaliszyk Remove SMT
2011-06-01 Christian Urban hopefully final fix for ho-functions
2011-06-01 Cezary Kaliszyk proved subst for All constructor in type schemes.
2011-05-25 Christian Urban added eq_iff and distinct lemmas of nominal datatypes to the simplifier
2011-02-19 Cezary Kaliszyk typeschemes/subst
2011-02-17 Cezary Kaliszyk further experiments with typeschemes subst
2011-02-07 Christian Urban cleaned up the experiments so that the tests go through
2011-01-31 Cezary Kaliszyk Experiments with substitution on set+
2011-01-30 Cezary Kaliszyk Showing that the binders difference is fresh for the left side solves the goal for 'set'.
2011-01-29 Cezary Kaliszyk Experiments with functions
2011-01-27 Christian Urban some experiments
2011-01-25 Christian Urban made eqvt-proof explicit in the function definitions
2011-01-18 Christian Urban some tryes about substitution over type-schemes
2010-12-31 Christian Urban changed res keyword to set+ for restrictions; comment by a referee
2010-12-28 Christian Urban automated all strong induction lemmas
2010-12-22 Christian Urban tuned examples
2010-12-22 Christian Urban properly exported strong exhaust theorem; cleaned up some examples
2010-12-16 Christian Urban simple cases for strong inducts done; infrastructure for the difficult ones is there
2010-11-14 Christian Urban moved rest of the lemmas from Nominal2_FSet to the TypeScheme example
2010-11-06 Christian Urban added a test about subtyping; disabled two tests, because of problem with function package
2010-10-14 Christian Urban major reorganisation of fset (renamed fset_to_set to fset, changed the definition of list_eq and fcard_raw)
2010-09-28 Christian Urban added Foo1 to explore a contrived example
2010-09-27 Christian Urban added postprocessed fresh-lemmas for constructors
2010-09-25 Christian Urban cleaned up two examples
2010-09-20 Christian Urban introduced a general procedure for structural inductions; simplified reflexivity proof
2010-09-03 Christian Urban moved a proof to Abs
2010-08-29 Christian Urban renamed NewParser to Nominal2
2010-08-28 Christian Urban added fs-instance proofs
2010-08-28 Christian Urban added proofs for fsupp properties
2010-08-25 Christian Urban cleaned up (almost completely) the examples
2010-08-25 Christian Urban automatic lifting
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-06-27 Christian Urban fixed according to changes in quotient
2010-06-02 Christian Urban fixed problem with bn_info
2010-05-25 Cezary Kaliszyk Substitution Lemma for TypeSchemes.
2010-05-25 Cezary Kaliszyk Simplified the proof
2010-05-25 Cezary Kaliszyk A lemma about substitution in TypeSchemes.
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-09 Christian Urban cleaned up a bit the examples; added equivariance to all examples
2010-05-04 Cezary Kaliszyk Move TypeSchemes to NewParser
less more (0) -60 tip