Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

beautiful code

Name: Anonymous 2015-01-28 22:43

Beautiful code. I want to create it. How can i do this?

Name: Anonymous 2015-01-28 22:44

Learn haskell

Name: Anonymous 2015-01-28 23:09

Not haskell ....

Name: Anonymous 2015-01-28 23:22

Name: Anonymous 2015-01-29 1:04

Learn Haskell

Name: Anonymous 2015-01-29 1:43

Smoke weed

Name: Anonymous 2015-01-29 1:52

Name: Anonymous 2015-01-29 3:31

smoke haskell everyday

Name: dank 2015-01-29 9:39

help

Name: Anonymous 2015-01-29 12:54

>>7
I'm not going to learn a language that doesn't even pass the man-or-boy test.

Name: Anonymous 2015-01-29 13:26

Symta's qsort is arguably more readable than Haskell's version

IHBT!

Name: Anonymous 2015-01-29 14:30

>>11
it uses readable `keep` and `skip` names for list comprehension. I.e. a skip{?<H} vs Haskell's ASCII artsy [y|y<-xs,y>=x]

Name: Anonymous 2015-01-29 15:41

>>12
The only readable part of the whole thing.

But while we're on the topic of keep and skip, I'd rather only have keep but named filter. It takes a predicate, if you want the complementary predicate it's clearer to write that in the first place.

Name: Anonymous 2015-01-29 17:30

>>13
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]

Name: Anonymous 2015-01-30 11:18

tfw just wanna write beautiful code but all this haskell symta shitsplerging all over my thread

Name: Anonymous 2015-01-30 11:54

>>15
Who are you quoting?

Name: Anonymous 2015-01-30 12:11

>>16
He was quoting you!

Name: Anonymous 2015-02-05 14:00

Learn Physics by Programming in Haskell

http://arxiv.org/abs/1412.4880

We describe a method for deepening a student's understanding of basic physics by asking the student to express physical ideas in a functional programming language. The method is implemented in a second-year course in computational physics at Lebanon Valley College. We argue that the structure of Newtonian mechanics is clarified by its expression in a language (Haskell) that supports higher-order functions, types, and type classes. In electromagnetic theory, the type signatures of functions that calculate electric and magnetic fields clearly express the functional dependency on the charge and current distributions that produce the fields. Many of the ideas in basic physics are well-captured by a type or a function.

Name: Anonymous 2015-02-05 14:13

>>18
Are you certain that Haskell is the best fit for your problem domain? Having recently tried to optimise a very simple number cruncher, and having failed to come even close to the performance of a borderline trivial C implementation (a language which I'm most certainly not an expert in), my faith in Haskell solving all problems has declined a little. I still think it has great merits when the codebases are large (types for the win) and performance isn't all that critical, of course.

Name: Anonymous 2015-02-05 15:40

>>19
for the win
dumb nigger

too dumb for lisp as well
megadumb not using your own lisp rofl shits all over haskell
lol too dumb to do

Name: Anonymous 2015-02-05 16:22

>>20
Lisp is unityped shit, which is obviously bad for large codebases.

Name: Anonymous 2015-02-05 16:46

>>21
you're under 30(50) lol nobody gives a shit what you think and what you think is ``large'' and your ``codebases''(fucking epic web monkey)

too dumb for the best non-language language too dumb for real math rofl just use c if you're gonna be such a nigger, it does everything and anything the best if you're good.
muh handholding

lol types the fuck are that

Name: Anonymous 2015-02-05 17:06

>>22
You're like the quintessence of fat, unintelligent and uncreative trolling. Yawn.

Name: Anonymous 2015-02-05 17:25

>>23
you're the anti-lisp anti-sicp newfag here

Name: Anonymous 2015-02-05 18:18

>>24
Anti-lisp? Yes. Newfag? Nope.

Name: Anonymous 2015-02-05 20:19

>>23
Did you say ``quintessence'' because you couldn't remember the word ``epitome'', fedorabro?

Name: Anonymous 2015-02-05 21:45

>>26
Quintessentially

Name: Anonymous 2015-02-05 22:55

Has /prog/ ever achieved quints?

Name: Anonymous 2015-02-06 0:58

>>28
Nice timestamp dubs

Name: Anonymous 2015-02-07 5:55

>>28
``31" are binary quints, so yes, quints have been achieved many times before.

Name: Anonymous 2015-02-07 9:03

Your an idiot if you aren't unsatisfied with every programming language.

Name: Anonymous 2015-02-07 11:32

>>31
If you're satisfied with every programming language, then go write in pure lambda calculus, you dumb fuck.

Name: Anonymous 2015-02-07 11:33

OCaml is satisfactory if they work on names in the standard library a bit and make exceptions more explicit.

Name: Anonymous 2015-02-07 11:46

>>33
Actually OCaml has tons of warts that INRIA doesn't fix because it doesn't give a crap.

Also, enjoy your strict evaluation and rampant side effects. Mutable ref cells are also an obvious piece of shit.

Name: Anonymous 2015-02-07 12:10

>>34
tons of warts
Go on. The following three points are not `tons'.
strict evaluation
Oh no, I know exactly when my values are going to be evaluated! That is terrible!
rampant side effects
FP 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.

Name: Anonymous 2015-02-07 12:21

>>35
I'm not going to google O'Caml's warts for you. Enjoy your piece of shit.

Name: Anonymous 2015-02-07 12:25

>>36
That's what I thought. Go back to masturbating over Haskell/ASM (delete as appropriate).

Name: Anonymous 2015-02-07 13:40

http://sds.podval.org/ocaml-sucks.html
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

Name: Anonymous 2015-02-07 14:00

>>1
Use agda, coq or some other language with dependent types. Programs will be pieces of pure logic, the types will reflect the values, beautiful theorems will inhabit your code and you know it is correct. (It will be slow as dogshit, though).

Name: Anonymous 2015-02-07 14:01

Btw, has Nikita landed here already?

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List