Parametric polymorphism and operational improvement

Hackett, Jennifer and Hutton, Graham (2018) Parametric polymorphism and operational improvement. Proceedings of the ACM on Programming Languages, 2 . ISSN 2475-1421

Full text not available from this repository.


Parametricity, in both operational and denotational forms, has long been a useful tool for reasoning about program correctness. However, there is as yet no comparable technique for reasoning about program improvement, that is, when one program uses fewer resources than another. Existing theories of parametricity cannot be used to address this problem as they are agnostic with regard to resource usage. This article addresses this problem by presenting a new operational theory of parametricity that is sensitive to time costs, which can be used to reason about time improvement properties. We demonstrate the applicability of our theory by showing how it can be used to prove that a number of well-known program fusion techniques are time improvements, including fixed point fusion, map fusion and short cut fusion.

Item Type: Article
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number:
Related URLs:
Depositing User: Hutton, Prof Graham
Date Deposited: 11 Jul 2018 14:36
Last Modified: 04 May 2020 19:45

Actions (Archive Staff Only)

Edit View Edit View