Re:Comparison of Haskell and Julia List Comprehensions
by shirogane86x on Thursday July 08, 2021 @03:52AM
(#27769328)
That's actually how list comprehensions work in F#: that would become:
[for xs in xss do for x in xs -> x]
(where -> is a shorthand for do yield)
in practice (after 3 years of professional F#), when writing functional code i'd actually rather have the result first rather than last. I got used to reading code right to left with Haskell so that's what feels most natural to me
e.g. with your example above,
What's confusing about the syntax is that `x` in your example above comes first, whereas in actual nested loops it comes last. So maybe: Could be alternative syntax that moves `x` to the end?