Finding parallel functional pearls : automatic parallel recursion scheme detection in Haskell functions via anti-unification
- Submitting institution
-
University of St Andrews
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 258269914
- Type
- D - Journal article
- DOI
-
10.1016/j.future.2017.07.024
- Title of journal
- Future Generation Computer Systems
- Article number
- -
- First page
- 669
- Volume
- 79
- Issue
- Part 2
- ISSN
- 0167-739X
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2017
- 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
-
2
- Research group(s)
-
D - Programming Languages
- Citation count
- 4
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Writing parallel programs is hard. Finding which parts of the program to parallelise is even harder. This work presented a new approach based on static analysis to find instances of parallel patterns in Haskell programs. The work uses a technique called anti-unification, which attempts to find the least-general generalisation of the pattern and its instances: effectively creating an interface between the pattern and the code instance. The work was applied to a number of representative examples. It was a key achievement on the EU RePhrase project.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
