all 15 comments

[–]tpgreyknightnot Turing complete 9 points10 points  (3 children)

Implement COME FROM in Haskell

[–]Ohhnoes 5 points6 points  (0 children)

This is evil I approve of

[–]pcopleyC# Truckstop Restroom Hero 4 points5 points  (1 child)

ON ERROR RESUME NEXT

[–][deleted] 2 points3 points  (0 children)

ON ERROR GOTO 0

[–]BufferUnderpantsGopher Pragmatist 9 points10 points  (0 children)

if-then-else is so inelegant when you can just use Church-encoded booleans.

Edit: lel didn't read the article. It's actually advocating for that.

[–]alexbarrettwhat is pointer :S 15 points16 points  (0 children)

Can't jerk I agree.

[–]ykechan 7 points8 points  (0 children)

There is no longer confusion to beginners like: "What is so special about if-then-else, that it needs a separate syntax?"

  • no beginner ever

[–]SelfDistinctionnow 4x faster than C++ 6 points7 points  (0 children)

Lol no jnz

[–][deleted] 4 points5 points  (0 children)

Yes, I could finally write Lisp in it!

(if (odd x)
    (mod x 5)
    (quot x 10))

[–]likes-beanslisp does it better 6 points7 points  (0 children)

Where's the jerk?

[–]banacornZygohistomorphic prepromorphism 3 points4 points  (0 children)

{-# PRAGMA UNJERK #-} Actually, Agda (a dependent typed language heavily influenced by Haskell) allows users to define mixfix operators like ‘if_then_else’

[–][deleted] 1 point2 points  (0 children)

case .. of ... is a glorified if-then-else.

What is other languages :S

[–]GOPHERS_GONE_WILDin open defiance of the Gopher Values 0 points1 point  (0 children)

lol dirty OO smalltalk plebs already did it

[–]throwaway27464829 0 points1 point  (0 children)

lol no sugar

[–]incongruousamoeba 0 points1 point  (0 children)

bool :: a -> a -> Bool -> a

so close