Skip to main content
Kent Academic Repository

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. Trends in Functional Programming . Intellect Books, Bristol, UK. ISBN 978-1-84150-176-5. (KAR id:14266)

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: Book section
Uncontrolled keywords: Haskell, refactoring, proof, HaRe, generalisation, move, module
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: Mark Wheadon
Date Deposited: 24 Nov 2008 18:02 UTC
Last Modified: 16 Nov 2021 09:52 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/14266 (The current URI for this page, for reference purposes)

University of Kent Author Information

Li, Huiqing.

Creator's ORCID:
CReDIT Contributor Roles:

Thompson, Simon.

Creator's ORCID: https://orcid.org/0000-0002-2350-301X
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.