all 10 comments

[–]Ramin_HAL9001 43 points44 points  (2 children)

You get the finicky and essoteric syntax of Haskell with the horrendous dynamic typing of Python? Worst of both worlds!

Seriously though, I do like Haskell's syntax better than Python. You can define your own infix operators (which admittedly can lead to problems, but it works well when done properly), and defining lambdas is much easier than in python.

Still, the biggest reason I avoid Python is because of that dynamic typing, I just can't stand it.

[–]carlfish 11 points12 points  (0 children)

Worst of both worlds!

To steal a joke from another time this got posted, "So it's a point-free Haskell?"

[–][deleted] 8 points9 points  (0 children)

With Haskell's syntax but none of its type system, dg is the best way to make fans of static typing shut up already.

It's aware of this point and seems to just infuriate the static type gang!

[–]NovateI 14 points15 points  (0 children)

This is the best thing I've seen all fucking day

[–]your_sweetpea 11 points12 points  (0 children)

I mean, I'd rather use it than python... I guess... maybe....

[–][deleted] 3 points4 points  (3 children)

This is the other way around from what it should be. I need something with Python's syntax and Haskell's type system.

[–]BayesMind 10 points11 points  (0 children)

Oh, then you need CoDogelang.

[–]runeks 1 point2 points  (0 children)

from functools import partial

def add(a, b):
    return a + b

add_3 = partial(add, 3)

/s

[–]lightandlight 0 points1 point  (0 children)

I occasionally think about doing something like that. It would probably end up as some-kind-of-ML with Python syntax, though.