An Expression Processor: A Case Study in Refactoring Haskell Programs

Brown, Christopher and Li, Huiqing and Thompson, Simon (2010) An Expression Processor: A Case Study in Refactoring Haskell Programs. In: Eleventh Symposium on Trends in Functional Programming. (Full text available)

PDF
Download (169kB) Preview
[img]
Preview
Official URL
http://www.cs.kent.ac.uk/pubs/2010/3009

Abstract

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: Faculties > Science Technology and Medical Studies > School of Computing > Programming Languages and Systems Group
Depositing User: Huiqing Li
Date Deposited: 21 Sep 2012 09:49
Last Modified: 22 Aug 2014 20:50
Resource URI: http://kar.kent.ac.uk/id/eprint/30667 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year