Parametric polymorphism and operational improvement
- Submitting institution
-
University of Nottingham, The
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1324482
- Type
- D - Journal article
- DOI
-
10.1145/3236763
- Title of journal
- Proceedings of the ACM on Programming Languages
- Article number
- 68
- First page
- 1
- Volume
- 2
- Issue
- ICFP
- ISSN
- 2475-1421
- Open access status
- Compliant
- Month of publication
- September
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Functional programs that are suitably polymorphic satisfy ‘free theorems’, useful mathematical properties whose validity is automatically guaranteed by the type checking process. This paper shows for the first time that polymorphic programs in lazy languages such as Haskell also satisfy ‘free improvements’, useful properties concerning the run-time efficiency of programs. That such properties can be deduced purely from the polymorphic types of programs is a surprising result, and shows ‘for free’ that a number of widely-used program fusion techniques improve efficiency.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
