Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification

Adam D. Barwell, Christopher Brown, Kevin Hammond

Open source

DOI
10.1016/j.future.2017.07.024
Published
2018-02
Container
Future Generation Computer Systems
Publisher
Elsevier BV
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1016/j.future.2017.07.024,
  title = {Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification},
  author = {Adam D. Barwell and Christopher Brown and Kevin Hammond},
  year = {2018},
  journal = {Future Generation Computer Systems},
  doi = {10.1016/j.future.2017.07.024},
  url = {https://doi.org/10.1016/j.future.2017.07.024}
}

RIS

TY  - JOUR
TI  - Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification
AU  - Adam D. Barwell
AU  - Christopher Brown
AU  - Kevin Hammond
PY  - 2018
JO  - Future Generation Computer Systems
DO  - 10.1016/j.future.2017.07.024
UR  - https://doi.org/10.1016/j.future.2017.07.024
ER  - 

APA

Barwell, A. D., Brown, C., & Hammond, K. (2018). Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification. Future Generation Computer Systems. https://doi.org/10.1016/j.future.2017.07.024

Source records