Proof Pearl—A Mechanized Proof of GHC’s Mergesort
- First Online:
- Cite this article as:
- Sternagel, C. J Autom Reasoning (2013) 51: 357. doi:10.1007/s10817-012-9260-7
- 441 Views
We present our Isabelle/HOL formalization of GHC’s sorting algorithm for lists, proving its correctness and stability. This constitutes another example of applying a state-of-the-art proof assistant to real-world code. Furthermore, it allows users to take advantage of the formalized algorithm in generated code.