Y
Hacker News
new
|
ask
|
show
|
jobs
by
thewakalix
790 days ago
Why? Is it mostly because of Haskell's purity (side-effect-freeness), so optimizations can change expressions more freely and safely?
1 comments
fooker
790 days ago
That, and the uniform s-expr/gadt representation of data structures instead of going wild with clever pointers.
link
dmytrish
789 days ago
I am not sure I understand what you mean in the context of Haskell.
link
fooker
789 days ago
https://wiki.haskell.org/GADTs_for_dummies
link