Total Haskell is reasonable Coq
Total Haskell is reasonable Coq
复制标题
DOI：
10.1145/3167092
复制
发表时间：
2017-11
期刊：
影响因子：
--
通讯作者：
Antal Spector-Zabusky;Joachim Breitner;C. Rizkallah;Stephanie Weirich
中科院分区：
文献类型：
--
作者：
Antal Spector-Zabusky;Joachim Breitner;C. Rizkallah;Stephanie Weirich
我们想使用COQ证明助手来验证Haskell程序的属性。在三个案例研究中 - 合法的单案，“赫顿的剃须刀”和现有的数据结构库，并证明了它们的正确性。 HS-to-COQ适用于现有的Haskell代码，并且其产生的输出可用于验证。
We would like to use the Coq proof assistant to mechanically verify properties of Haskell programs. To that end, we present a tool, named hs-to-coq, that translates total Haskell programs into Coq programs via a shallow embedding. We apply our tool in three case studies – a lawful Monad instance, “Hutton’s razor”, and an existing data structure library – and prove their correctness. These examples show that this approach is viable: both that hs-to-coq applies to existing Haskell code, and that the output it produces is amenable to verification.