We introduce an automatic method for producing stateful ML programs together with proofs of correctness from monadic functions in HOL. Our mechanism supports references, exceptions, and I/O operations, and can generate functions manipulating local state, which can then be encapsulated for use in a pure context. We apply this approach to several non-trivial examples, including the instruction encoder and register allocator of the otherwise pure CakeML compiler, which now benefits from better runtime performance. This development has been carried out in the HOL4 theorem prover.

中文翻译：

---

从 Monadic HOL 函数生成 CakeML 的证明合成

我们介绍了一种自动生成有状态 ML 程序的方法，以及 HOL 中一元函数的正确性证明。我们的机制支持引用、异常和 I/O 操作，并且可以生成操作本地状态的函数，然后可以将其封装以在纯上下文中使用。我们将这种方法应用于几个重要的示例，包括原本纯 CakeML 编译器的指令编码器和寄存器分配器，它们现在受益于更好的运行时性能。这种发展已经在 HOL4 定理证明器中进行了。