Don’t bind yourself to do notation!
Using Agda to Prove Correctness of Refactorings on Monads
T. Zandbergen (TU Delft - Electrical Engineering, Mathematics and Computer Science)
L. Miljak – Mentor (TU Delft - Programming Languages)
Jesper Cockx – Mentor (TU Delft - Programming Languages)
Koen Langendoen – Graduation committee member (TU Delft - Embedded Systems)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
This paper provides a refactoring from do notation to >>= operators and proves that this refactoring maintains observational equivalence. As programs grow ever larger and more complex, there is a growing need to automatically apply refactorings to these programs in a dependable manner. Current refactoring engines often contain errors, even if they are widely used and thoroughly tested. The methods used in the proof of contextual equivalence are described in this paper, with the goal of supporting future research into correct-by-construction refactorings.