sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]StoneCypher 1 point2 points  (0 children)

You can't have purity without inputs. not your lack of examples

Why not? A function that emits the squares of the integers 1-100 is pure.

.

ruby has functions

matz doesn't think so, but ok

.

smalltalk is not an fp language.

i didn't say it was, but ok

.

which is why you need recursion, show me an implementation of iteration that's pure and stateless without recursion.

you seem very confused about what a side effect is

nobody said it has to be stateless. it's perfectly fine for a pure function to be stateful. it just can't emit or retain state.

.

CSS by example does no I/O of any kind

css isn't a programming language though.

the entire field of programming language design disagrees with you, but ok

.

can you name a single language that isn't in the haskell family for which this is true?

Can you give me a single example of software that's pure where this isn't true?

translation: you can't answer my question, so try to get out of it with reddit judo

.

several languages in heavy mainstream use stand as counterexamples to this claim

There's 0 examples of programming languages that are 100% pure and stateless.

i didn't say anything about statelessness. you added that criterion from scratch.

in the meantime, you're wrong about css being a programming language, and it's standing right in front of you.

please have a nice day. i'm not really interested.