Skip to main content

Data-Driven Refactorings for Haskell

Adams, Stephen (2017) Data-Driven Refactorings for Haskell. Doctor of Philosophy (PhD) thesis, University of Kent,. (KAR id:69589)

PDF Publisher pdf
Language: English

Download (1MB) Preview
[thumbnail of 27sadamsThesisFinal.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format


Agile software development allows for software to evolve slowly over time. Decisions

form of technical debt. Technical debt is the concept that reworking a program that

behaviour of a more robust solution. Refactoring is one of the primary ways to reduce

Refactoring is the process of changing the internal structure of a program without

quality, maintainability, and extensibility of the source program. Performing refactorings

tools very useful.

type system allows for complex and powerful data models and abstractions. These

argues that these parts of a program accrue technical debt, and that refactoring is an

Refactorings exist that tackle issues with a program's data model, however these

on work done to design and automate refactorings that help Haskell programmers

This work also discussed the current design and implementation of HaRe (the Haskell Refactorer). HaRe now supports the Glasgow Haskell Compiler's implementation of

in its implementation.

Item Type: Thesis (Doctor of Philosophy (PhD))
Thesis advisor: Thompson, Simon
Uncontrolled keywords: refactoring, functional programming, haskell
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
SWORD Depositor: System Moodle
Depositing User: System Moodle
Date Deposited: 16 Oct 2018 09:10 UTC
Last Modified: 16 Feb 2021 13:58 UTC
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):