haftmann [Sat, 24 Dec 2011 15:53:09 +0100] rev 45966
tuned proofs
haftmann [Sat, 24 Dec 2011 15:53:09 +0100] rev 45965
generalized type signature to permit overloading on `set`
haftmann [Sat, 24 Dec 2011 15:53:08 +0100] rev 45964
added monad instance for `set`
haftmann [Sat, 24 Dec 2011 15:53:08 +0100] rev 45963
enum type class instance for `set`; dropped misfitting code lemma for trancl
haftmann [Sat, 24 Dec 2011 15:53:08 +0100] rev 45962
finite type class instance for `set`
haftmann [Sat, 24 Dec 2011 15:53:08 +0100] rev 45961
treatment of type constructor `set`
haftmann [Sat, 24 Dec 2011 15:53:07 +0100] rev 45960
lattice type class instances for `set`; added code lemma for Set.bind
haftmann [Sat, 24 Dec 2011 15:53:07 +0100] rev 45959
`set` is now a proper type constructor; added operation for set monad
huffman [Fri, 23 Dec 2011 16:37:27 +0100] rev 45958
simplify some proofs
huffman [Fri, 23 Dec 2011 15:55:23 +0100] rev 45957
remove redundant lemma word_sub_def
huffman [Fri, 23 Dec 2011 15:34:18 +0100] rev 45956
add lemmas bin_cat_zero and bin_split_zero
huffman [Fri, 23 Dec 2011 15:24:22 +0100] rev 45955
more uses of 'induct arbitrary'