The integration of the executable sets has lead me to the inclusion of
the canonical fold combinator on HOL lists (now List.fold :: ('a = 'b
= 'b) = 'a list = 'b = 'b) into the List theory corpus. In
connection with this I did a cleanup on the List.fold(l/r) material as
well. The idea is to
Next attempt on NEWS on sets committed.
Florian
--
Home:
http://www.in.tum.de/~haftmann
PGP available:
http://home.informatik.tu-muenchen.de/haftmann/pgp/florian_haftmann_at_informatik_tu_muenchen_de
signature.asc
Description: OpenPGP digital signature
How much relative time do the quickcheck examples in HOL-ex take?
According to my feeling time could be high to separate these into a
separate session, to facilitate maintenance.
Florian
--
Home:
http://www.in.tum.de/~haftmann
PGP available:
