Formalisation of Haskell Refactorings

Li, Huiqing and Thompson, Simon (2005) Formalisation of Haskell Refactorings. In: van Eekelen, Marko and Hammond, Kevin, eds. Trends In Funtional Programming. ISBN 9781841501765. (Full text available)

PDF
Download (158kB) Preview
[img]
Preview

Abstract

Refactoring is a well-known technique for improving the design of existing programs without changing their external behaviour. HaRe is the refactoring tool we have built to support refactoring Haskell programs. Along with the development of HaRe, This formalisation process helps to clarify the meaning of refactorings, improves our confidence in the behaviour-preservation of refactorings, and reduces the need for testing. This paper gives an overview of HaRe, and shows our approach to the formalisation of refactorings.

Item Type: Conference or workshop item (UNSPECIFIED)
Uncontrolled keywords: Haskell, refactoring, proof, HaRe, generalisation, move, module
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:02
Last Modified: 22 Aug 2014 21:01
Resource URI: http://kar.kent.ac.uk/id/eprint/14266 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year