Do foldl or foldr short circuit in Daml like they do in Haskell? AFAIU, they can’t as that depends on lazy evaluation of the folded over elements. One can recover some control by introducing a short circuiting operation (ex. if then else, (||), or (&&)) inside the lambda argument?

[image] Leonid_Rozenberg: Is this correct ? Yes. [image] Leonid_Rozenberg: Are there any concerns about the build up of the nested r that is passed to f ? I’m not usually concerned. In the vast majority of practical situations, it doesn’t matter, and what I’m really concerned about is…

Short circuiting folds

Questions

Leonid_Rozenberg June 29, 2021, 6:01pm 6

I’ll split this into two separate questions, so that @cocreature can get credit for answering even more questions!

1 Like

Does Daml perform any tail call optimizations

Topic		Replies	Views
In Daml, `foldl1` works differently from Haskell, is this intentional? Features & Bugs	4	314	January 31, 2022
Daml indexed equivalent Questions daml	3	249	November 4, 2021
No Foldable instance for Set Features & Bugs daml	3	534	June 1, 2021
Trying to implement recursion schemes but bumped into issue when testing in script Questions daml	6	205	March 10, 2022
Question on DAML function Questions daml	5	323	June 24, 2020

Short circuiting folds

Related Topics