One Monad to Prove Them All
Guardado en:
| Udgivet i: | arXiv.org (Feb 1, 2019), p. n/a |
|---|---|
| Hovedforfatter: | |
| Andre forfattere: | , |
| Udgivet: |
Cornell University Library, arXiv.org
|
| Fag: | |
| Online adgang: | Citation/Abstract Full text outside of ProQuest |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2073872413 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 024 | 7 | |a 10.22152/programming-journal.org/2019/3/8 |2 doi | |
| 035 | |a 2073872413 | ||
| 045 | 0 | |b d20190201 | |
| 100 | 1 | |a Dylus, Sandra | |
| 245 | 1 | |a One Monad to Prove Them All | |
| 260 | |b Cornell University Library, arXiv.org |c Feb 1, 2019 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a 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. To prove properties about a Haskell function in Coq, Mona has to translate the function into Coq code. As Coq programs have to be total and Haskell programs are often not, Mona has to model partiality explicitly in Coq. In her quest for a solution Mona finds an ancient manuscript that explains how properties about Haskell functions can be proven in the proof assistant Agda by translating Haskell programs into monadic Agda programs. By instantiating the monadic program with a concrete monad instance the proof can be performed in either a total or a partial setting. Mona discovers that the proposed transformation does not work in Coq due to a restriction in the termination checker. In fact the transformation does not work in Agda anymore as well, as the termination checker in Agda has been improved. We follow Mona on an educational journey through the land of functional programming where she learns about concepts like free monads and containers as well as basics and restrictions of proof assistants like Coq. These concepts are well-known individually, but their interplay gives rise to a solution for Mona's problem based on the originally proposed monadic tranformation that has not been presented before. When Mona starts to test her approach by proving a statement about simple Haskell functions, she realizes that her approach has an additional advantage over the original idea in Agda. Mona's final solution not only works for a specific monad instance but even allows her to prove monad-generic properties. Instead of proving properties over and over again for specific monad instances she is able to prove properties that hold for all monads representable by a container-based instance of the free monad. In order to strengthen her confidence in the practicability of her approach, Mona evaluates her approach in a case study that compares two implementations for queues. In order to share the results with other functional programmers the fairy tale is available as a literate Coq file. If you are a citizen of the land of functional programming or are at least familiar with its customs, had a journey that involved reasoning about functional programs of your own, or are just a curious soul looking for the next story about monads and proofs, then this tale is for you. | |
| 653 | |a Translating | ||
| 653 | |a Transformations (mathematics) | ||
| 653 | |a Software | ||
| 653 | |a Containers | ||
| 653 | |a Program verification (computers) | ||
| 653 | |a Fairy tales | ||
| 653 | |a Theorems | ||
| 653 | |a Properties (attributes) | ||
| 653 | |a Theorem proving | ||
| 653 | |a Programming languages | ||
| 653 | |a Queues | ||
| 653 | |a Functional programming | ||
| 700 | 1 | |a Christiansen, Jan | |
| 700 | 1 | |a Teegen, Finn | |
| 773 | 0 | |t arXiv.org |g (Feb 1, 2019), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2073872413/abstract/embedded/ZKJTFFSVAI7CB62C?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/1805.08059 |