Skip to main content

Refactoring pattern matching

Wang, Meng, Gibbons, Jeremy, Matsuda, Kazutaka, Hu, Zhenjiang (2013) Refactoring pattern matching. Science of Computer Programming, 78 (11). pp. 2216-2242. ISSN 0167-6423. (doi:10.1016/j.scico.2012.07.014)

PDF - Author's Accepted Manuscript
Download (389kB) Preview
[img]
Preview
Official URL
http://www.sciencedirect.com/science/article/pii/S...

Abstract

Defining functions by pattern matching over the arguments is advantageous for understanding and reasoning, but it tends to expose the implementation of a datatype. Significant effort has been invested in tackling this loss of modularity; however, decoupling patterns from concrete representations while maintaining soundness of reasoning has been a challenge. Inspired by the development of invertible programming, we propose an approach to program refactoring based on a right-invertible language rinv—every function has a right (or pre-) inverse. We show how this new design is able to permit a smooth incremental transition from programs with algebraic datatypes and pattern matching, to ones with proper encapsulation, while maintaining simple and sound reasoning.

Item Type: Article
DOI/Identification number: 10.1016/j.scico.2012.07.014
Uncontrolled keywords: Functional programming; Refactoring; Pattern matching; Invertible programming; Abstract datatypes; Fusion
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
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: Meng Wang
Date Deposited: 01 Mar 2015 00:18 UTC
Last Modified: 29 May 2019 14:17 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/47478 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year