Sciweavers

PEPM
2010
ACM

Clone detection and elimination for Haskell

14 years 8 months ago
Clone detection and elimination for Haskell
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), 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. Categories and Subject Descriptors D.2.3 [SOFTWARE ENGINEERING]: Coding Tools and Techniques; D.2.6 []: Programming Environments; D.2.7 []: Distribution, Maintenance, and Enhancement; D.3.2 [PROGRAMMING LANGUAGES]: Language Classifications — Applicative (functional) languages General Terms Languages, Design K...
Christopher Brown, Simon Thompson
Added 17 Mar 2010
Updated 17 Mar 2010
Type Conference
Year 2010
Where PEPM
Authors Christopher Brown, Simon Thompson
Comments (0)