1. What have the authors contributed in "Finding parallel functional pearls: automatic parallel recursion scheme detection in haskell functions <ce:italic>via</ce:italic> anti-unification " ?
This paper describes a new technique for identifying potentially parallelisable code structures in functional programs.. This paper presents a technique that detects instances of potentially parallelisable recursion schemes in Haskell 98 functions.. This allows us to automatically introduce parallelism, without requiring the programmer to structure their code a priori in terms of specific higher-order functions.. The authors have implemented their approach in the Haskell refactoring tool, HaRe, and demonstrated its use on a range of common benchmarking examples.. Using their technique, the authors show that recursion schemes can be easily detected, that parallel implementations can be easily introduced, and that they can achieve real parallel speedups ( up to 23.
read more
2. What are the future works mentioned in the paper "Finding parallel functional pearls: automatic parallel recursion scheme detection in haskell functions <ce:italic>via</ce:italic> anti-unification " ?
The authors envisage, however, that further work on argument derivation will allow us to detect recursion schemes in a broader range of structures.. The authors also intend to explore how equational reasoning, in conjunction with standard reduction operations, can be applied to inferred substitutions to successfully derive pattern arguments more flexibly.
read more
