in Scala, isn't that true? You could side effect, dropping a db table, in that function since not pure fp, no? note - not against pure fp!
-
-
You can't do *anything*, such as return 7, since it will be a type error, not a program.
1 reply 0 retweets 1 like -
Personally, constraining myself to purity and never trusting blindly. With the function A => A there should only be one.
1 reply 0 retweets 1 like -
See, Fast & Loose Reasoning is Morally Correct.
1 reply 0 retweets 1 like -
I worry that anything found from pragmatism may buckle under the weight of a moral imperative.
1 reply 0 retweets 0 likes -
Where does pragmatism come into it?
1 reply 0 retweets 0 likes -
The second sentence it does not. In the first self constraints arnt binding, some libraries are ok.
1 reply 0 retweets 0 likes -
Lots of modification is A => B => A with constraints on A and B which then silently hides the transformation.
1 reply 0 retweets 0 likes -
What about when you minimise those constraints, such that the candidate answers are very small, with an associated probability?
1 reply 0 retweets 0 likes -
Is that not just a lens codiagonal coalgebra? Pardon if my terms are incorrect, we're working at my fringes.
1 reply 0 retweets 0 likes
Looks like the type of const (K combinator) to me, without any constraints. Twitter is terrible for this.
-
-
Agreed. I guess my concern is that Scala is written impure a lot. So to deal with that I manage my code so that my principles hold within.
1 reply 0 retweets 0 likes -
It is true that Scala is typically written poorly.
0 replies 0 retweets 1 like
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.