Difference between revisions of "Publications/newton.20.tfp"
From LRDE
Line 1: | Line 1: | ||
{{Publication |
{{Publication |
||
− | | published = |
+ | | published = true |
− | | date = 2020 |
+ | | date = 2020-01-14 |
⚫ | |||
| title = Performance Comparison of Several Folding Strategies |
| title = Performance Comparison of Several Folding Strategies |
||
⚫ | |||
| booktitle = Trends in Functional Programming |
| booktitle = Trends in Functional Programming |
||
+ | | lrdestatus = accepted |
||
− | | lrdekeywords = fold, binary decision diagram, scala, lisp, rational numbers |
+ | | lrdekeywords = fold, binary decision diagram, scala, lisp, rational numbers, functional programming |
− | | note = Submitted |
||
+ | | lrdenewsdate = 2020-01-14 |
||
⚫ | |||
+ | | lrdepaper = http://www.lrde.epita.fr/dload/papers/newton.20.tfp.pdf |
||
+ | | lrdeprojects = Spot |
||
⚫ | |||
| abstract = In this article we examine the computation order and consequent performance of three different conceptual implementations of the fold function. We explore a set of performance based experiments on different implementations of this function. In particular, we contrast the fold-left implementation with two other implements we refer to as pair-wise-fold and tree-like-fold. We explore two application areas: ratio arithmetic and Binary Decisions Diagram construction. We demonstrate several cases where the performance of certain algorithms is very different depending on the approach taken. In particular iterative computations where the object size accumulates are good candidates for the tree-like-fold. |
| abstract = In this article we examine the computation order and consequent performance of three different conceptual implementations of the fold function. We explore a set of performance based experiments on different implementations of this function. In particular, we contrast the fold-left implementation with two other implements we refer to as pair-wise-fold and tree-like-fold. We explore two application areas: ratio arithmetic and Binary Decisions Diagram construction. We demonstrate several cases where the performance of certain algorithms is very different depending on the approach taken. In particular iterative computations where the object size accumulates are good candidates for the tree-like-fold. |
||
| type = inproceedings |
| type = inproceedings |
Revision as of 14:49, 14 January 2020
- Authors
- Jim Newton
- Where
- Trends in Functional Programming
- Place
- Krakow, Poland
- Type
- inproceedings
- Projects
- Spot
- Keywords
- fold, binary decision diagram, scala, lisp, rational numbers, functional programming
- Date
- 2020-01-14
Abstract
In this article we examine the computation order and consequent performance of three different conceptual implementations of the fold function. We explore a set of performance based experiments on different implementations of this function. In particular, we contrast the fold-left implementation with two other implements we refer to as pair-wise-fold and tree-like-fold. We explore two application areas: ratio arithmetic and Binary Decisions Diagram construction. We demonstrate several cases where the performance of certain algorithms is very different depending on the approach taken. In particular iterative computations where the object size accumulates are good candidates for the tree-like-fold.
Documents
Bibtex (lrde.bib)
@InProceedings{ newton.20.tfp, author = {Jim Newton}, title = {Performance Comparison of Several Folding Strategies}, booktitle = {Trends in Functional Programming}, year = 2020, note = {Submitted}, address = {Krak{\'o}w, Poland}, month = feb, abstract = {In this article we examine the computation order and consequent performance of three different conceptual implementations of the fold function. We explore a set of performance based experiments on different implementations of this function. In particular, we contrast the fold-left implementation with two other implements we refer to as pair-wise-fold and tree-like-fold. We explore two application areas: ratio arithmetic and Binary Decisions Diagram construction. We demonstrate several cases where the performance of certain algorithms is very different depending on the approach taken. In particular iterative computations where the object size accumulates are good candidates for the tree-like-fold.} } @InProceedings{ newton.20.tfp, title = {Performance Comparison of Several Folding Strategies}, author = {Jim Newton}, booktitle = {Trends in Functional Programming}, year = 2020, lrdestatus = {accepted}, address = {Krakow, Poland}, month = jan, abstract = {In this article we examine the computation order and consequent performance of three different conceptual implementations of the fold function. We explore a set of performance based experiments on different implementations of this function. In particular, we contrast the fold-left implementation with two other implements we refer to as pair-wise-fold and tree-like-fold. We explore two application areas: ratio arithmetic and Binary Decisions Diagram construction. We demonstrate several cases where the performance of certain algorithms is very different depending on the approach taken. In particular iterative computations where the object size accumulates are good candidates for the tree-like-fold.} }