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

Pages: 1-

Haskell

Name: Anonymous 2013-11-01 10:46

I really really like Haskell.
Haskell is life.
Haskell is love.

Name: Anonymous 2013-11-01 11:32

Lisp rules, haskal drools.

Name: Anonymous 2013-11-01 13:13

>>2
Lolno

Name: Anonymous 2013-11-01 13:27

Recursive fibonacci still explodes when trying to get 40:th number. Even Python won't explode (when using iterative method).

And please don't tell me about tail recursion. That's just a hack you have to use when you don't have loops.

Name: Anonymous 2013-11-01 13:56

>>4
Stop programming with a toaster. Stop writing shitty code. Even I don't get runtime errors when I look for the factorial of 99 using C.

Name: Anonymous 2013-11-01 14:03

Scheme is a better language than Haskell.

Name: Anonymous 2013-11-01 14:52

>>6
Haskell has TYPES
TYPE THEORY motherfucker!!!

Name: Anonymous 2013-11-01 14:55

>>6

How? Haskell has cleaner and nerdier syntax compared to ugly snake-case and parens overdose. Haskell has more libraries and is used in the real world more than Scheme. Haskell is also faster.

Name: Anonymous 2013-11-01 15:53

>>3
Lolyes.

>>6
Scheme is a combination of CL and Haskell. The good parts CL, the bad parts Haskell.

>>7
You can easily define a bunch of lisp macros to immerse yourself entirely in the anus of type theory and you can even entirely do away with the use of mutation (look up Liskell). I don't know why you would do that since using zygohistomorphic prepromorphisms doesn't make your code more readable (at least not to people without without PhDs in category theory AND in computer science).

>>8
How? C++ has cleaner and nerdier syntax compared to ugly snake-case and parens overdose. C++ has more libraries and is used in real world more than Scheme. C++ is also faster.

Name: Anonymous 2013-11-01 18:06

>>7
Types are an optimization. Static typing is a premature optimization.

Name: Anonymous 2013-11-01 20:30

>>10
Everything is a premature optimization nowadays.

Do you want us to use Ruby and Javashit for everything?

Name: Anonymous 2013-11-01 22:18

>>9
C++ has cleaner and nerdier syntax
Stopped reading right there.

Name: Anonymous 2013-11-01 23:24

Types are an optimization.
In the future, not all data will be reducible to a representation by integers. CPU's will support, as primitive and atomic datatypes, names, colors, moods, political parties, and social security numbers. All of this, of course, will be subject to internal standard-setting politics by a committee capable of making such technology web5.0 compatible and infinitely scalable.

Name: Anonymous 2013-11-02 1:24

Satori can only be achieved through a life of Haskell study.

All reading SICP gives you is the ability to say that you've read SICP.

Name: Anonymous 2013-11-02 21:45

>>14
Are you saying that satori is the realization that Haskell is shit?

Name: Anonymous 2013-11-05 8:04

What should I read to learn Haskell? I'm not getting that "aha" moment with Scheme.

Name: Anonymous 2013-11-05 9:29

>>16
If SICP is too slow for you either start doing all the exercises as you read or try The Land of Lisp (which focuses on CL instead, but is still a great read).

Name: Anonymous 2013-11-05 12:20

>>16-17
Or maybe you could try being more patient.

Name: Anonymous 2013-11-06 5:50

Name a programming language that has a better type system than Haskell.

Name: Anonymous 2013-11-06 8:57

>>19
brainfuck

Name: Anonymous 2013-11-06 13:47

>>19
Every other language (except javascript, maybe).

Name: Anonymous 2013-11-06 19:21

Ok, a question...

Just started learning Haskell. Really beginner stuff just now.. But I see the preferred data container is a list? Really? Isn't that slow as fuck? It doesn't work well with CPU cache and takes memory overhead.

Or does the GHC optimize lists to something that is sequentally in memory (like C array)? Or is there some array-type that I should use when I wanted performance? Please tell me that it doesn't really use linked lists everywhere. I really would like to learn this language!

Name: Anonymous 2013-11-06 23:45

>>22
Lists are the preferred data containers in the same way arrays are supposed to be the "default" data containers in other languages: they work fine for some basic cases, but if you're doing BIG DATA then you should consider using a more sophisticated data structure.

Name: Anonymous 2013-11-09 7:21

>>11
I use FIOC for everything.

Name: Anonymous 2013-11-09 8:04

>>24
HASKALL has FIOC in some syntaxes.

Name: Anonymous 2013-11-09 9:46

>>25
No, FOIC, the snake. *hisssss*

Name: Anonymous 2013-11-09 12:42

>>25
Isn't it more of a FAOC than a FIOC?

Name: Anonymous 2013-11-09 19:21

>>27
What does the A stand for?

Name: Anonymous 2013-11-09 19:46

>>28
Abstractization?

Name: Anonymous 2013-11-09 20:55

>>28,29
Alignment.

Name: Anonymous 2013-11-10 2:07

>>28
Hint: ends with NUS.

Name: Anonymous 2013-11-10 2:16

FORCED DEAD-DOGIFICATION OF CODE THREAD OVER

Name: Anonymous 2013-11-10 3:26

>>31
Alumnus?

Name: Anonymous 2013-11-10 11:22

>>30

Okay. But that doesn't mean Python is a shit language. They made a lot of improvements with 3.4

Name: Anonymous 2013-11-10 14:14

>>34
Like what?

Name: Anonymous 2013-11-10 15:20

>>35
Web 3.5 compatible enterprise embedded server support.

Name: Anonymous 2013-11-10 20:11

>>36
SOLD
Don't change these.
Name: Email:
Entire Thread Thread List
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode + RSS -