Difference between revisions of "Publications/newton.20.tfp"
From LRDE
(Created page with "{{Publication | published = false | date = 2020-02-01 | authors = Jim Newton | title = Performance Comparison of Several Folding Strategies | booktitle = Trends in Functional...") |
|||
| (7 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{Publication |
{{Publication |
||
| published = false |
| published = false |
||
| − | | date = 2020 |
+ | | date = 2020-01-14 |
| authors = Jim Newton |
| authors = Jim Newton |
||
| title = Performance Comparison of Several Folding Strategies |
| title = Performance Comparison of Several Folding Strategies |
||
| booktitle = Trends in Functional Programming |
| booktitle = Trends in Functional Programming |
||
| ⚫ | |||
| ⚫ | |||
| + | | lrdeprojects = Spot |
||
| ⚫ | |||
| + | | lrdepaper = http://www.lrde.epita.fr/dload/papers/newton.20.tfp.pdf |
||
| ⚫ | |||
| + | | lrdenewsdate = 2020-01-14 |
||
| address = Kraków, Poland |
| address = Kraków, Poland |
||
| − | | abstract = In this article we examine the computation order and consequent performance of three different conceptual implementations of the fold function. |
+ | | 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. |
| − | | |
+ | | nodoi = |
| + | | type = misc |
||
| id = newton.20.tfp |
| id = newton.20.tfp |
||
| bibtex = |
| bibtex = |
||
| − | @ |
+ | @Misc<nowiki>{</nowiki> newton.20.tfp, |
author = <nowiki>{</nowiki>Jim Newton<nowiki>}</nowiki>, |
author = <nowiki>{</nowiki>Jim Newton<nowiki>}</nowiki>, |
||
title = <nowiki>{</nowiki>Performance Comparison of Several Folding Strategies<nowiki>}</nowiki>, |
title = <nowiki>{</nowiki>Performance Comparison of Several Folding Strategies<nowiki>}</nowiki>, |
||
booktitle = <nowiki>{</nowiki>Trends in Functional Programming<nowiki>}</nowiki>, |
booktitle = <nowiki>{</nowiki>Trends in Functional Programming<nowiki>}</nowiki>, |
||
year = 2020, |
year = 2020, |
||
| + | note = <nowiki>{</nowiki>Accepted<nowiki>}</nowiki>, |
||
| − | note = submitted, |
||
address = <nowiki>{</nowiki>Krak<nowiki>{</nowiki>\'o<nowiki>}</nowiki>w, Poland<nowiki>}</nowiki>, |
address = <nowiki>{</nowiki>Krak<nowiki>{</nowiki>\'o<nowiki>}</nowiki>w, Poland<nowiki>}</nowiki>, |
||
month = feb, |
month = feb, |
||
| Line 32: | Line 36: | ||
depending on the approach taken. In particular iterative |
depending on the approach taken. In particular iterative |
||
computations where the object size accumulates are good |
computations where the object size accumulates are good |
||
| − | candidates for the tree-like-fold.<nowiki>}</nowiki> |
+ | candidates for the tree-like-fold.<nowiki>}</nowiki>, |
| + | nodoi = <nowiki>{</nowiki><nowiki>}</nowiki> |
||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Latest revision as of 19:08, 7 April 2023
- Authors
- Jim Newton
- Where
- Trends in Functional Programming
- Place
- Kraków, Poland
- Type
- misc
- 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)
@Misc{ newton.20.tfp,
author = {Jim Newton},
title = {Performance Comparison of Several Folding Strategies},
booktitle = {Trends in Functional Programming},
year = 2020,
note = {Accepted},
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.},
nodoi = {}
}