2010-10-15 Christian Urban further cleaning
2010-10-15 Christian Urban typo
2010-10-15 Cezary Kaliszyk FSet: stronger fact in Isabelle.
2010-10-15 Cezary Kaliszyk FSet synchronizing
2010-10-15 Cezary Kaliszyk Synchronizing FSet further.
2010-10-15 Cezary Kaliszyk Partially merging changes from Isabelle
2010-10-14 Christian Urban fixed the typo in the abstract and the problem with append (the type of map_k
2010-10-14 Christian Urban changed format of the pearl paper
2010-10-14 Christian Urban deleted some unused lemmas
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-10-13 Christian Urban more on the pearl paper
2010-10-12 Christian Urban added a section about abstractions
2010-10-12 Christian Urban tiny work on the pearl paper
2010-10-08 Christian Urban tuned
2010-10-08 Christian Urban added apendix to paper detailing one proof
2010-10-08 Christian Urban minor
2010-10-08 Christian Urban minor
2010-10-08 Christian Urban down to 20 pages
2010-10-07 Cezary Kaliszyk minor
2010-10-06 Christian Urban down to 21 pages and changed strong induction section
2010-10-06 Christian Urban tuned
2010-10-06 Christian Urban down to 22 pages
2010-10-05 Christian Urban down to 23 pages
2010-10-05 Christian Urban down to 24 pages and a bit
2010-10-05 Christian Urban llncs and more sqeezing
2010-10-04 Christian Urban first part of sqeezing everything into 20 pages (at the moment we have 26)
2010-10-04 Christian Urban changed to llncs
2010-10-01 Christian Urban merged
2010-10-01 Christian Urban minor experiments
2010-09-30 Christian Urban merged
2010-09-29 Christian Urban simplified exhaust proofs
2010-10-01 Cezary Kaliszyk Made the paper to compile with the renamings.
2010-09-29 Christian Urban merged
2010-09-29 Christian Urban worked example Foo1 with induct_schema
2010-09-29 Christian Urban merged
2010-09-29 Christian Urban use also induct_schema for the Let-example (permute_bn is used)
2010-09-29 Christian Urban test with induct_schema for simpler strong_ind proofs
2010-09-29 Cezary Kaliszyk substitution definition with 'next_name'.
2010-09-28 Christian Urban merged
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-27 Christian Urban post-processed eq_iff and supp threormes according to the fv-supp equality
2010-09-27 Christian Urban more consistent naming in Abs.thy
2010-09-27 Christian Urban some experiments
2010-09-27 Christian Urban added simp rules for prod_fv and prod_alpha
2010-09-26 Christian Urban a few more words about Ott
2010-09-25 Christian Urban lifted size_thms and exported them as <name>.size
2010-09-25 Christian Urban cleaned up two examples
2010-09-25 Christian Urban added example about datatypes
2010-09-23 Christian Urban updated to Isabelle 22 Sept
2010-09-22 Christian Urban removed dead code
2010-09-22 Christian Urban fixed
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-09-17 Christian Urban updated to Isabelle Sept 16
2010-09-17 Christian Urban updated to Isabelle Sept 13
2010-09-12 Christian Urban tuned code
2010-09-10 Christian Urban tuned (to conform with indentation policy of Markus)
2010-09-10 Christian Urban supp-proofs work except for CoreHaskell and Modules (induct is probably not finding the correct instance)
2010-09-04 Christian Urban generated inducts rule by Project_Rule.projections
(0) -1000 -300 -100 -60 +60 +100 +300 tip