Pro tip: you can't.
Name a relevant project you completed using Haskell
Luis Perez
Gabriel Miller
But papers and post in blogs
Daniel James
> 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
John Hill
the project of learning scala
Brayden Hill
My blog is made with Haskyll, so there is that.
Julian Long
rebuilt wolfenstein 3d using haskell
Blake Garcia
xmonad
James Lopez
I really cant tho
Elijah Evans
big if tru
Colton Wood
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]
Grayson Diaz
This is true. Especially learning recursion
Charles Hernandez
why do people think recursion is hard
Chase Reyes
YOUR_INTELLIGENCE = 10
def intelligence(initial_intel, count):
if initial_intel
Matthew Cook
type. it would have been 18. im a little tipsy
Caleb Wright
i always give up
Samuel Brown
>relevant
>in Haskell
Yeah, found the problem, OP.
Easton Fisher
>Sup Forums
>something other than hello world
Found the problem.
Luis Ward
>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..
Christopher Green
xmonad
James Taylor
Doesn't use tail calls.
Austin Foster
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.
Eli Adams
>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.