Skip to main content

Clone Detection and Elimination for Haskell

Brown, Christopher, Thompson, Simon (2010) Clone Detection and Elimination for Haskell. In: Gallagher, John and Voigtlander, Janis, eds. PEPM'10: Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation. . pp. 182-196. ACM Press ISBN 978-1-60558-727-1. (doi:10.1145/1706356.1706378)


Duplicated code is a well known problem in software maintenance and refactoring. Code clones tend to increase program size and several studies have shown that duplicated code makes maintenance and code understanding more complex and time consuming. This paper presents a new technique for the detection and removal of duplicated Haskell code. The system is implemented within the refactoring framework of the Haskell Refactorer (HaRe), and uses an Abstract Syntax Tree (AST) based approach. Detection of duplicate code is automatic, while elimination is semi-automatic, with the user managing the clone removal. After presenting the system, an example is given to show how it works in practice.

Item Type: Conference or workshop item (UNSPECIFIED)
DOI/Identification number: 10.1145/1706356.1706378
Uncontrolled keywords: determinacy analysis, Craig interpolants
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Simon Thompson
Date Deposited: 21 Sep 2012 09:49 UTC
Last Modified: 29 May 2019 09:19 UTC
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year