News for hackers. Stuff that matters.
Re:Non-determinism: a sublanguage rather than a monad by danharaj on Wednesday September 20, 2017 @07:17PM (#15299216)
The majority of internet conversations about monads never get past the most shallow introduction. The most important feature of monads is that they can be composed via monad transformers. A la carte languages and algebraic effects are nice, but monad composition is more powerful.

Also, as someone in the Haskell industry, I think you're wrong about trends. The last 5 or so years have been an accelerating trend of Haskell adoption. Of course it is still dwarfed by most other languages, but the number of multi-million dollar contracts I've seen executed in Haskell has been multiplying.

Re:Non-determinism: a sublanguage rather than a monad by bojo on Wednesday September 20, 2017 @07:39PM (#15299348)
As a relatively tiny data point, I've introduced Haskell at a small telecom doing $350M/yr in revenue. This kind of environment screams "Enterprise", but as it turns out the vast majority of problems that need solved can be done quite gracefully with Haskell.
Re:Non-determinism: a sublanguage rather than a monad by alphaalpha101 on Wednesday September 20, 2017 @10:41PM (#15300209)
Yeah at the end of the day it's just another programming language, and you can really get things done in any programming language.
Re:Non-determinism: a sublanguage rather than a monad by lmm on Thursday September 21, 2017 @04:47AM (#15301599)
It's an incremental improvement on what's gone before, sure, but it does offer a bunch of genuinely useful facilities that a lot of programming languages just don't have. I'd never want to go back to a language that was missing HKT, missing libraries of generic operations on monads, missing libraries of generic operations on recursive datastructures via fixed points, or missing safe derivation of operations on structured data via typeclass derivation or similar.
[dead]
Re:Non-determinism: a sublanguage rather than a monad by dang on Friday September 22, 2017 @04:00AM (#15310199)
Could you please keep programming language flamewars off HN? We're trying to avoid the destruction that befalls places that host these.
Re:Non-determinism: a sublanguage rather than a monad by alphaalpha101 on Wednesday September 20, 2017 @10:20PM (#15300111)
The most important feature of monads definitely isn't composition, because they don't compose well at all. Monad composition is the worst feature, by far, because it doesn't exist.

>Also, as someone in the Haskell industry, I think you're wrong about trends. The last 5 or so years have been an accelerating trend of Haskell adoption. Of course it is still dwarfed by most other languages, but the number of multi-million dollar contracts I've seen executed in Haskell has been multiplying.

That's my point: that's the hype cycle, and it's now peaking as people realise what a lot of effort it is to actually use monads in reality with the awful complexity of monad transformer stacks and such.

Re:Non-determinism: a sublanguage rather than a monad by kreetx on Thursday September 21, 2017 @01:48AM (#15300866)
Can you clarify what do you mean by they don't compose at all? It feels like you've had some tough experiences with monads (monad transformers), and I agree, they are hard to get into.
Re:Non-determinism: a sublanguage rather than a monad by lambdas on Thursday September 21, 2017 @06:59AM (#15302184)
Sometimes two monads composed don't form another monad. Unlike Functors and Applicatives.

Simple example, if you have a list containing functions ([Reader r a]) it forms an Applicative fine as they compose. However you can't satisfy the conditions needed to form a Monad.

Re:Non-determinism: a sublanguage rather than a monad by danharaj on Thursday September 21, 2017 @10:55AM (#15304037)
You can compose monads whenever you have a distributive law for them. Usually there's an obvious one. In your example there's a distributive law that uses the same parameter for every function, this allows you to compose the monads.

When there's several possible distributive laws or none, that's important. It means that either the interactions between the two effects are subtle and need to be further specified or they are completely incompatible.

Algebraic effects can only handle effects that trivially commute. So monad composition is a finer, thus more expressive operation.

Re:Non-determinism: a sublanguage rather than a monad by alphaalpha101 on Thursday September 21, 2017 @09:34PM (#15308769)
This reminds me of the 'fine-grained permissions' vs. 'broad permissions' security models. The former is more expressive, more powerful, etc. It also is technical, complicated and confusing. The latter is less powerful and less expressive, but people actually use it, because it's simple and easy to understand.

Expressing effects using monad transformer stacks might be more expressive and allow finer-grained distinctions, or whatever (please elaborate what you mean, I'm interested), but it's syntactically ugly (lift), it's confusing, and it's not clear that the expressiveness you get is practically useful.

In contrast, algebraic effects might 'only handle effects that trivially commute' (again, going to need more detail on this), but they're easy to understand and easy to use. They're much more likely to be a practically usable effect system that real programmers can really use in the real world in a way that doesn't convolute code with details of how you compose effects unduly.