urbanc [Mon, 19 Dec 2005 15:29:51 +0100] rev 18437
added proofs to show that every atom-kind combination
is in the respective finite-support class (now have to
adjust the files according to Florian's changes)
urbanc [Mon, 19 Dec 2005 12:58:15 +0100] rev 18436
added thms to perm_compose (so far only composition
theorems were included where the type of the permutation
was equal)
urbanc [Mon, 19 Dec 2005 12:09:56 +0100] rev 18435
tuned one comment
urbanc [Mon, 19 Dec 2005 12:08:16 +0100] rev 18434
fixed a bug that occured when more than one atom-type
is declared.
nipkow [Mon, 19 Dec 2005 09:19:08 +0100] rev 18433
fixed proof
urbanc [Sun, 18 Dec 2005 20:10:15 +0100] rev 18432
more cleaning up - this time of the cp-instance
proofs
urbanc [Sun, 18 Dec 2005 14:36:42 +0100] rev 18431
improved the finite-support proof
added finite support proof for options (I am
surprised that one does not need more fs-proofs;
at the moment only lists, products, units and
atoms are shown to be finitely supported (of
course also every nominal datatype is finitely
supported))
deleted pt_bool_inst - not necessary because discrete
types are treated separately in nominal_atoms
urbanc [Sun, 18 Dec 2005 13:38:06 +0100] rev 18430
improved the code for showing that a type is
in the pt-axclass (I try to slowly overcome
my incompetence with such ML-code).
wenzelm [Sat, 17 Dec 2005 01:58:41 +0100] rev 18429
simp del: empty_Collect_eq;
wenzelm [Sat, 17 Dec 2005 01:00:40 +0100] rev 18428
sort_distinct;
wenzelm [Sat, 17 Dec 2005 01:00:38 +0100] rev 18427
added sort_distinct;
removed obsolete unique_strings;
urbanc [Fri, 16 Dec 2005 18:22:58 +0100] rev 18426
added container-lemma fresh_eqvt
(definition: container-lemma contains all instantiations
of a lemma from the general theory)
urbanc [Fri, 16 Dec 2005 18:20:59 +0100] rev 18425
I think the earlier version was completely broken
(not sure about this one)
urbanc [Fri, 16 Dec 2005 18:20:03 +0100] rev 18424
tuned more proofs