[isabelle-dev] Merge-Sort Implementation

[Florian Haftmann]

> Nonetheless, we still have the real-based Library.random from "ML for
> the working programmer", because without it quickcheck performs really
> bad.

AFAIR this has only been the case for the ancient SML quickcheck,
whereas my quickcheck implementation comes with a random generator in
HOL based on a cousin in Haskell.  If this is true, we could throw away
Library.random.  Maybe Lukas can comment on this.

	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

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 262 bytes
Desc: OpenPGP digital signature
URL: <https://mailman46.in.tum.de/pipermail/isabelle-dev/attachments/20111027/cc0ad0fc/attachment.sig>