Question

Implement Scala Cats Traverse for State

score 172 · Answer 1 · 2023-03-18T15:52:34.197000

172

Views

Implement Scala Cats Traverse for State

Published on 18 March 2023 at 15:52

score 187 · Answer 2 · 2022-11-26T21:02:17.280000

187

Views

Is there a name in Haskell for `[m a] -> m a`?

Published on 26 November 2022 at 21:02

score 192 · Answer 3 · 2022-11-21T00:48:18.603000

192

Views

Is there a name for this higher-level "bi" version of distribute in Haskell?

Published on 21 November 2022 at 00:48

score 128 · Answer 4 · 2022-11-13T10:03:54.180000

128

Views

List Traversal in a lazy setting that produces expressions in WHNF

Published on 13 November 2022 at 10:03

score 175 · Answer 5 · 2022-07-14T21:55:37.520000

175

Views

Haskell traverse and filter through a list while lifting results

Published on 14 July 2022 at 21:55

score 484 · Answer 6 · 2022-05-09T17:20:16.947000

484

Views

Why are traversals defined over Applicatives, fundamentally?

Published on 09 May 2022 at 17:20

score 73 · Answer 7 · 2022-03-09T18:55:59.740000

73

Views

TypeScript - using recursive generics properly

Published on 09 March 2022 at 18:55

score 141 · Answer 8 · 2022-02-23T20:21:57.670000

141

Views

What is This More General Almost-Traversal Operation

Published on 23 February 2022 at 20:21

score 262 · Answer 9 · 2021-07-20T00:54:03.263000

262

Views

Can ZipList be Distributive?

Published on 20 July 2021 at 00:54

score 181 · Answer 10 · 2021-04-22T10:02:27.847000

181

Views

Can trees be generalized to allow any traversable sub-tree?

Published on 22 April 2021 at 10:02

score 326 · Answer 11 · 2021-04-17T11:08:35.047000

326

Views

in Haskell, how to replace elements of a pair in the presence of Maybe values?

Published on 17 April 2021 at 11:08

score 97 · Answer 12 · 2021-01-22T21:43:01.260000

97

Views

How to interpret a Traversable type as an Applicative in this function?

Published on 22 January 2021 at 21:43

score 143 · Answer 13 · 2020-12-21T16:58:07.753000

143

Views

Building a list from a non-traversable without recursion

Published on 21 December 2020 at 16:58

score 147 · Answer 14 · 2020-11-20T18:49:47.623000

147

Views

What subclasses of `Profunctor` does `FunList` support?

Published on 20 November 2020 at 18:49

score 121 · Answer 15 · 2020-08-23T02:55:04.073000

121

Views

Does a joined Bitraversable require Monad?

Published on 23 August 2020 at 02:55

score 147 · Answer 16 · 2020-07-06T19:15:16.860000

147

Views

How could sequence be written down for Arrows?

Published on 06 July 2020 at 19:15

score 828 · Answer 17 · 2020-06-01T16:39:38.550000

828

Views

What should a Traversable instance look like for a Tree datatype with a nested Maybe value?

Published on 01 June 2020 at 16:39

score 353 · Answer 18 · 2020-04-13T19:46:32.337000

353

Views

Why can't a Traversable visit its elements more than once?

Published on 13 April 2020 at 19:46

score 178 · Answer 19 · 2020-03-09T23:41:52.217000

178

Views

How to apply a traversable of functions to a one value

Published on 09 March 2020 at 23:41

score 189 · Answer 20 · 2020-02-11T04:07:04.823000

189

Views

How to model this recurisve structure in Haskell?

Published on 11 February 2020 at 04:07

List Question

Implement Scala Cats Traverse for State

Is there a name in Haskell for `[m a] -> m a`?

Is there a name for this higher-level "bi" version of distribute in Haskell?

List Traversal in a lazy setting that produces expressions in WHNF

Haskell traverse and filter through a list while lifting results

Why are traversals defined over Applicatives, fundamentally?

TypeScript - using recursive generics properly

What is This More General Almost-Traversal Operation

Can ZipList be Distributive?

Can trees be generalized to allow any traversable sub-tree?

in Haskell, how to replace elements of a pair in the presence of Maybe values?

How to interpret a Traversable type as an Applicative in this function?

Building a list from a non-traversable without recursion

What subclasses of `Profunctor` does `FunList` support?

Does a joined Bitraversable require Monad?

How could sequence be written down for Arrows?

What should a Traversable instance look like for a Tree datatype with a nested Maybe value?

Why can't a Traversable visit its elements more than once?

How to apply a traversable of functions to a one value

How to model this recurisve structure in Haskell?

Trending Questions

Popular # Hahtags

Popular Questions