Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorBarwell, Adam David
dc.contributor.authorBrown, Christopher Mark
dc.contributor.authorSarkar, Susmit
dc.date.accessioned2021-07-29T10:30:09Z
dc.date.available2021-07-29T10:30:09Z
dc.date.issued2021-07-18
dc.identifier.citationBarwell , A D , Brown , C M & Sarkar , S 2021 , Proving renaming for Haskell via dependent types : a case-study in refactoring soundness . in 8th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2021) . pp. 1-10 , 8th International Workshop on Rewriting Techniques for Program Transformations and Evaluation , Buenos Aeires , Argentina , 18/07/21 .en
dc.identifier.citationworkshopen
dc.identifier.otherPURE: 275239759
dc.identifier.otherPURE UUID: 8d71d5b3-2472-4fde-afda-55c21286ccf2
dc.identifier.otherORCID: /0000-0001-6030-2885/work/97885026
dc.identifier.otherORCID: /0000-0003-1236-7160/work/97885332
dc.identifier.urihttp://hdl.handle.net/10023/23673
dc.description.abstractWe present a formally verified refactoring framework for a subset of Haskell 98. Our framework is implemented in the dependently-typed language, Idris, which allows us to encode soundness proofs as an integral part of the implementation. We give the formal definition of our static semantics for our Haskell 98 subset, which we encode as part of the AST, ensuring that only well-formed programs may be represented and transformed. This forms a foundation upon which refactorings can be formally specified. We then define soundness of refactoring implementations as conformity to their specification. We demonstrate our approach via renaming, a canonical and well-understood refactoring, giving its implementation alongside its formal specification and soundness proof.
dc.format.extent10
dc.language.isoeng
dc.relation.ispartof8th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2021)en
dc.rightsCopyright 2021 © A. Barwell, C. Brown & S. Sarkar. This work is licensed under the Creative Commons Attribution License.en
dc.subjectHaskellen
dc.subjectRefactoringen
dc.subjectDependent typesen
dc.subjectIdrisen
dc.subjectRenamingen
dc.subjectProof-carrying codeen
dc.subjectSoundnessen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectT-NDASen
dc.subject.lccQA75en
dc.titleProving renaming for Haskell via dependent types : a case-study in refactoring soundnessen
dc.typeConference itemen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews.School of Computer Scienceen
dc.identifier.urlhttps://www.ipl.riec.tohoku.ac.jp/wpte2021/en


This item appears in the following Collection(s)

Show simple item record