Skip to main content

An Expression Processor: A Case Study in Refactoring Haskell Programs

Brown, Christopher, Li, Huiqing, Thompson, Simon (2010) An Expression Processor: A Case Study in Refactoring Haskell Programs. In: Page, Rex, ed. Eleventh Symposium on Trends in Functional Programming. . pp. 182-196. (KAR id:30667)

Language: English
Download (178kB) Preview
[thumbnail of hare.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:


Refactoring is the process of changing the structure of a program while preserving its behaviour. This behaviour preservation is crucial so that refactorings do not introduce any bugs. Refactoring is aimed at increasing code quality, programming productivity and code reuse. Refactoring has been practised manually by programmers for as long as programs have been written; however, with the advent of refactoring tools, refactoring can be performed semi-automatically, allowing refactorings to be performed (and undone) easily. In this paper, we briefly describe a number of refactorings implemented in the Haskell Refactorer, HaRe. In addition to this, we also implement a simple expression processor to demonstrate how some of the refactorings implemented in HaRe can be used to aid programmers in developing Haskell software.

Item Type: Conference or workshop item (UNSPECIFIED)
Uncontrolled keywords: determinacy analysis, Craig interpolants
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Huiqing Li
Date Deposited: 21 Sep 2012 09:49 UTC
Last Modified: 16 Nov 2021 10:08 UTC
Resource URI: (The current URI for this page, for reference purposes)
Thompson, Simon:
  • Depositors only (login required):


Downloads per month over past year