nominal2: Graph

first split of tutorrial theory
2011-01-20, by Christian Urban
added a very rough version of the tutorial; all seems to work
2011-01-19, by Christian Urban
added obtain_fresh lemma; tuned Lambda.thy
2011-01-19, by Christian Urban
base file for the tutorial (contains definitions for heigt, subst and beta-reduction)
2011-01-19, by Christian Urban
ported some of the old proofs to serve as testcases
2011-01-19, by Christian Urban
added eqvt and supp lemma for removeAll (function from List.thy)
2011-01-19, by Christian Urban
theory name as it should be
2011-01-19, by Christian Urban
removed diagnostic code
2011-01-19, by Christian Urban
added Minimal file to test things
2011-01-19, by Christian Urban
defined height as a function that returns an integer
2011-01-19, by Christian Urban
deleted diagnostic code
2011-01-18, by Christian Urban
some tryes about substitution over type-schemes
2011-01-18, by Christian Urban
defined properly substitution
2011-01-18, by Christian Urban
derived stronger Abs_eq_iff2 theorems
2011-01-18, by Christian Urban
made alpha_abs_set_stronger1 stronger
2011-01-18, by Christian Urban
removed finiteness assumption from set_rename_perm
2011-01-18, by Christian Urban
alpha_abs_set_stronger1
2011-01-18, by Cezary Kaliszyk
alpha_abs_let_stronger is not true in the same form
2011-01-18, by Cezary Kaliszyk
the function translating lambda terms to locally nameless lambda terms; still needs a stronger abs_eq_iff lemma...at the moment only proved for restrictions
2011-01-18, by Christian Urban
modified the renaming_perm lemmas
2011-01-18, by Christian Urban
added a translation function from lambda-terms to deBruijn terms (equivariance fails at the moment)
2011-01-17, by Christian Urban
added a few examples of functions to Lambda.thy
2011-01-17, by Christian Urban
exported nominal function code to external file
2011-01-17, by Christian Urban
removed old testing code from Lambda.thy
2011-01-17, by Christian Urban
moved high level code from LamTest into the main libraries.
2011-01-17, by Christian Urban
eliminated tracing code; added flag so that equivariance is only proved for the function graph, not the relation
2011-01-17, by Christian Urban
subst also works now
2011-01-15, by Christian Urban
nominal_function works now completely for frees and depth; still a propbelm with subst; no unproved assumptions
2011-01-15, by Christian Urban
strengthened renaming lemmas
2011-01-14, by Christian Urban
added eqvt_lemmas for subset and psubset
2011-01-13, by Christian Urban
a few lemmas about freshness for at and at_base
2011-01-10, by Christian Urban
added a property about finite support in the presense of eqvt_at
2011-01-10, by Christian Urban
instantiated fundef_ex1_eqvt_at theorem with the indction hypothesis
2011-01-09, by Christian Urban
solved subgoals for depth and subst function
2011-01-09, by Christian Urban
added eqvt_at premises in function definition - however not proved at the moment
2011-01-09, by Christian Urban
added one further lemma about equivariance of THE_default
2011-01-07, by Christian Urban
equivariance of THE_default under the uniqueness assumption
2011-01-07, by Christian Urban
derived equivariance for the function graph and function relation
2011-01-07, by Christian Urban
a modified function package where, as a test, True has been injected into the compatibility condictions
2011-01-06, by Christian Urban
removed last traces of debugging code
2011-01-06, by Christian Urban
removed debugging code abd introduced a guarded tracing function
2011-01-06, by Christian Urban
moved Weakening up....it does not compile when put at the last position
2011-01-06, by Christian Urban
tuned
2011-01-06, by Christian Urban
added weakening to the test cases
2011-01-06, by Christian Urban
cleaned up weakening proof and added a version with finit sets
2011-01-06, by Christian Urban
same
2011-01-06, by Christian Urban
some further lemmas for fsets
2011-01-06, by Christian Urban
made sure the raw datatypes and raw functions do not get any mixfix syntax
2011-01-06, by Christian Urban
exported the code into a separate file
2011-01-05, by Christian Urban
strong rule inductions; as an example the weakening lemma works
2011-01-05, by Christian Urban
final version of the ESOP paper; used set+ instead of res as requested by one reviewer
2011-01-04, by Christian Urban
file with most of the strong rule induction development
2011-01-03, by Christian Urban
simple cases for string rule inductions
2011-01-03, by Christian Urban
changed res keyword to set+ for restrictions; comment by a referee
2010-12-31, by Christian Urban
added proper case names for all induct and exhaust theorems
2010-12-31, by Christian Urban
added small example for strong inductions; functions still need a sorry
2010-12-31, by Christian Urban
removed local fix for bug in induction_schema; added setup method for strong inductions
2010-12-30, by Christian Urban
automated all strong induction lemmas
2010-12-28, by Christian Urban
proper application of induction_schema and strong_exhaust rules; needs local fix in induction_schema.ML
2010-12-28, by Christian Urban
generated goals for strong induction theorems.
2010-12-26, by Christian Urban
test with strong inductions
2010-12-23, by Christian Urban
moved all strong_exhaust code to nominal_dt_quot; tuned examples
2010-12-23, by Christian Urban
moved generic functions into nominal_library
2010-12-23, by Christian Urban
slight tuning
2010-12-22, by Christian Urban
slight tuning
2010-12-22, by Christian Urban
tuned examples
2010-12-22, by Christian Urban
added fold_right which produces the correct term for left-infix operators
2010-12-22, by Christian Urban
updated to Isabelle 22 December
2010-12-22, by Christian Urban
a bit tuning
2010-12-22, by Christian Urban
corrected premises of strong exhausts theorems
2010-12-22, by Christian Urban
properly exported strong exhaust theorem; cleaned up some examples
2010-12-22, by Christian Urban
all examples for strong exhausts work; recursive binders need to be treated differently; still unclean version with lots of diagnostic code
2010-12-21, by Christian Urban
one interesting case done
2010-12-19, by Christian Urban
a stronger statement for at_set_avoiding
2010-12-19, by Christian Urban
tuned
2010-12-17, by Christian Urban
tuned
2010-12-17, by Christian Urban
simple cases for strong inducts done; infrastructure for the difficult ones is there
2010-12-16, by Christian Urban
added theorem-rewriter conversion
2010-12-16, by Christian Urban
freshness theorem in strong exhausts; (temporarily includes a cheat_tac to make all tests go through)
2010-12-14, by Christian Urban
created strong_exhausts terms
2010-12-12, by Christian Urban
moved setify and listify functions into the library; introduced versions that have a type argument
2010-12-12, by Christian Urban
updated
2010-12-10, by Christian Urban
a bit more tuning of the paper
2010-12-09, by Christian Urban
brought the paper to 20 pages plus one page appendix
2010-12-09, by Christian Urban
first tests about exhaust
2010-12-08, by Christian Urban
moved some code into the nominal_library
2010-12-08, by Christian Urban
moved definition of raw bn-functions into nominal_dt_rawfuns
2010-12-08, by Christian Urban
kept the nested structure of constructors (belonging to one datatype)
2010-12-08, by Christian Urban
moved general theorems into the libraries
2010-12-07, by Christian Urban
automated permute_bn theorems
2010-12-07, by Christian Urban
updated to changes in Isabelle
2010-12-07, by Christian Urban
deleted nominal_dt_supp.ML
2010-12-06, by Christian Urban
moved code from nominal_dt_supp to nominal_dt_quot
2010-12-06, by Christian Urban
automated alpha_perm_bn theorems
2010-12-06, by Christian Urban
ordered raw_bn_info to agree with the order of the raw_bn_functions; started alpha_bn proof
2010-12-06, by Christian Urban
updated to Isabelle 2nd December
2010-12-03, by Christian Urban
isarfied some of the high-level proofs
2010-11-29, by Christian Urban
added abs_rename_res lemma
2010-11-29, by Christian Urban
completed proofs in Foo2
2010-11-29, by Christian Urban
completed the strong exhausts rules for Foo2 using general lemmas
2010-11-28, by Christian Urban
tuned proof to reduce number of warnings
2010-11-27, by Christian Urban
disabled the Foo examples, because of heavy work
2010-11-27, by Christian Urban
slightly simplified the Foo2 tests and hint at a general lemma
2010-11-26, by Christian Urban
completely different method fro deriving the exhaust lemma
2010-11-26, by Christian Urban
merged
2010-11-26, by Christian Urban
merged
2010-11-25, by Christian Urban
added example from the F-ing paper by Rossberg, Russo and Dreyer
2010-11-24, by Christian Urban
implemented concrete suggestion of 3rd reviewer
2010-11-24, by Christian Urban
missing freshness assumptions
2010-11-26, by Cezary Kaliszyk
foo2 strong induction
2010-11-25, by Cezary Kaliszyk
foo2 full exhausts
2010-11-24, by Cezary Kaliszyk
Foo2 strong_exhaust for first variable.
2010-11-24, by Cezary Kaliszyk
single rename in let2
2010-11-22, by Cezary Kaliszyk
current isabelle
2010-11-22, by Cezary Kaliszyk
added example Foo2.thy
2010-11-21, by Christian Urban
tuned example
2010-11-15, by Christian Urban
proved that bn functions return a finite set
2010-11-15, by Christian Urban
added a test for the various shallow binders
2010-11-15, by Christian Urban
fixed bug in fv function where a shallow binder binds lists of names
2010-11-15, by Christian Urban
merged Nominal-General directory into Nominal; renamed Abs.thy to Nominal2_Abs.thy
2010-11-14, by Christian Urban