Name: Anonymous 2015-01-28 22:43
Beautiful code. I want to create it. How can i do this?
Symta's qsort is arguably more readable than Haskell's version
skip{?<H} vs Haskell's ASCII artsy [y|y<-xs,y>=x] The only readable part of the whole thing.Haskell version has no readable parts.
But while we're on the topic of keep and skip, I'd rather only have keep but named filter.The name `filter` is too verbose for practical use. In the first Symta these methods were called just `k` and `s`. It is just happened that 1-letter identifiers are too small to notice quickly.
if you want the complementary predicate it's clearer to write that in the first place.[citation needed]
tfw just wanna write beautiful code but all this haskell symta shitsplerging all over my thread
for the windumb nigger
tons of wartsGo on. The following three points are not `tons'.
strict evaluationOh no, I know exactly when my values are going to be evaluated! That is terrible!
rampant side effectsFP is just its primary modus operandum. It lets you use mutability and IO when you want so you can (for example) add in debug logging without poisoning every calling function with monads.
Mutable ref cells are also an obvious piece of shit.Yes, the standard library is suboptimal, but there are at least two others you can drop in with minimal effort.
False Sense of Security
Few Basic Types
Silent Integer Overflow
Module Immutability
Polymorphism Causes Run-time Type Errors
No Macros
Record field naming hell
Syntax
No Polymorphism
Inconsistent function sets
No dynamic variables
Optional ~ arguments suck
Partial argument application inconsistency
Arithmetic's readability
Silent name conflict resolution
Order of evaluation
No object input/output
Compiler stops after the first error
No stack trace for natively compiled executables
Debugger sucks
GC sucks
No implicit forward declarations
Standard Library Sucks
Also, enjoy your strict evaluation and rampant side effects. Mutable ref cells are also an obvious piece of shit.
Array SortedAscending 256 Int) and simplicity in other places (SimpleArray Int) without having to prove termination, thus without having to be stuck with structural recursion and having to write pages of stupid proofs.