News for hackers. Stuff that matters.
Re:Haskell Concepts in One Sentence by scottmsul on Sunday March 26, 2017 @01:34AM (#13959359)
It makes a List of Lists, then combines those into a List.

[5,3,4] becomes [f(5), f(3), f(4)], but f(x) must return a List. Those inner Lists are then concatenated.

When I say "original data structure", I mean the type of data structure is the same (in this case, List).

Re:Haskell Concepts in One Sentence by jnordwick on Sunday March 26, 2017 @02:31AM (#13959532)
What is the data structures don't support a join operation, like a tree?
Re:Haskell Concepts in One Sentence by scottmsul on Sunday March 26, 2017 @02:45AM (#13959558)
We would need a way to transform a Tree of Trees into a single Tree. The inner Trees would be at leaf nodes of the outer Tree, so they could be attached in place.

Although I recall monads need to satisfy certain laws, and I don't recall if Trees satisfy them or not. Just because something is a data structure does not necessarily imply it is a monad.

Re:Haskell Concepts in One Sentence by dllthomas on Monday March 27, 2017 @09:27PM (#13973240)
A rose tree is a monad.