<?xml version="1.0" encoding="UTF-8"?>
<xml><records><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sandra Dylus</style></author><author><style face="normal" font="default" size="100%">Jan Christiansen</style></author><author><style face="normal" font="default" size="100%">Finn Teegen</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">One Monad to Prove Them All</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2019</style></year></dates><secondary-title><style face="normal" font="default" size="100%">The Art, Science, and Engineering of Programming</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.22152/programming-journal.org/2019/3/8</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">3</style></volume><number><style face="normal" font="default" size="100%">3</style></number><abstract><style face="normal" font="default" size="100%">One Monad to Prove Them All is a modern fairy tale about curiosity and perseverance, two important properties of a successful PhD student. We follow the PhD student Mona on her adventure of proving properties about Haskell programs in the proof assistant Coq. On the one hand, as a PhD student in computer science Mona observes an increasing demand for correct software products. In particular, because of the large amount of existing software, verifying existing software products becomes more important. Verifying programs in the functional programming language Haskell is no exception. On the other hand, Mona is delighted to see that communities in the area of theorem proving are becoming popular. Thus, Mona sets out to learn more about the interactive theorem prover Coq and verifying Haskell programs in Coq.</style></abstract></record></records></xml>
