Journal of Automated Reasoning

, Volume 51, Issue 4, pp 357–370

Proof Pearl—A Mechanized Proof of GHC’s Mergesort


    • School of Information ScienceJapan Advanced Institute of Science and Technology

DOI: 10.1007/s10817-012-9260-7


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.


Mergesort Theorem proving Code generation

Copyright information

© The Author(s) 2012