From: Tobias Nipkow <nipkow@in.tum.de>
Efficient Mergesort
Christian Sternagel
We provide a formalization of the mergesort algorithm as used in GHC's
Data.List module, proving correctness and stability. Furthermore,
experimental data suggests that generated (Haskell-)code for this
algorithm is much faster than for previous algorithms available in the
Isabelle distribution.
http://afp.sourceforge.net/entries/Efficient-Mergesort.shtml
Happy sorting!
Last updated: Nov 21 2024 at 12:39 UTC