Pro tip: you can't.
>>62003136
But papers and post in blogs
>>62003136
> learned a bunch of neat math and compsci theory
> improved my coding habits
> fizzbuzz-tier Haskell code on my GitHub actually helps my career
10/10 would learn me a Haskell again
>>62003136
the project of learning scala
>>62003136
My blog is made with Haskyll, so there is that.
>>62003136
rebuilt wolfenstein 3d using haskell
xmonad
I really cant tho
>>62008390
big if tru
>>62008390
just like the creators of Ultima VII rewrote the game in assebly to make it work on the SNES and thats why it was so shitty [citation needed]
>>62004928
This is true. Especially learning recursion
>>62010405
why do people think recursion is hard
>>62010631
YOUR_INTELLIGENCE = 10
def intelligence(initial_intel, count):
if initial_intel<20:
initial_intel+=1
count=intelligence(initial_intel, count+1)
return count
print "It took you %s tries before you got recursion right" % intelligence(YOUR_INTELLIGENCE,0)
most people try it with a low intelligence ability score and it just takes them many tries before they get it correct.
admittedly by my own code my initial intelligence score would have been 10
>>62010719
type. it would have been 18. im a little tipsy
>>62003136
i always give up
>>62003136
>relevant
>in Haskell
Yeah, found the problem, OP.
>>62003136
>/g/
>something other than hello world
Found the problem.
>>62004928
>read online tutorial about lambda calculus (1 day)
>work through "the little schemer", apply in online repl (3 days)
>work through SICP (3 weeks)
Boom, you just got career-tier reputation + "neat CompSci" + coding habits in a fraction of the time Haskell would take to learn..
>>62003136
xmonad
>>62010719
Doesn't use tail calls.
>>62010719
Bad example, missing the point of recursion..def intelligence(intel):
return 1 if intel >= 20 else 1 + intelligence(intel + 1)
YOUR_INTELLIGENCE = 10
print "It took you %s tries before you got recursion right" % intelligence(YOUR_INTELLIGENCE)
Read SICP.
>>62003136
>class Contravariant f => Divisible f where
>A Divisible contravariant functor is the contravariant analogue of Applicative.
>In denser jargon, a Divisible contravariant functor is a monoid object in the category of presheaves from Hask to Hask, equipped with Day convolution mapping the Cartesian product of the source to the Cartesian product of the target.
>By way of contrast, an Applicative functor can be viewed as a monoid object in the category of copresheaves from Hask to Hask, equipped with Day convolution mapping the Cartesian product of the source to the Cartesian product of the target.
Actual fucking haskell documentation.