Re:Julia 0.5 Highlights
by pklausler on Tuesday October 11, 2016 @02:32PM
(#12687213)
"Functional language" is ill-defined, hence my specific question about static typing and purity. I would really like to have a language for scientific computing that had good scalable performance as well as static types and referential transparency.
[ Parent
| on HN ]
Re:Julia 0.5 Highlights
by StefanKarpinski on Tuesday October 11, 2016 @02:42PM
(#12687338)
As far as I know, no such system exists. Strict static typing and numerical computing are, I suspect, more at odds with each other than they casually appear to be. The seemingly simple `+` operator is the most polymorphic and overloaded function-like entity in many static languages (and often can't be defined as a normal function for that very reason). And `+` doesn't hold a candle to the polymorphism of array indexing and slicing, which is pretty crucial for productive numerical work.
Thanks for your reply.
Someday, Haskell will get a good matrix library, and then I'll be happy.
Oh, you meant static typing when you wrote strong typing above? That makes more sense.
Yes, I sure did. Sorry for the confusion.
Re:Julia 0.5 Highlights
by leephillips on Tuesday October 11, 2016 @03:17PM
(#12687630)
Fortran?
Modern Fortran is an awesome power tool and I love it. But it's hardly a pure functional programming language!
Re:Julia 0.5 Highlights
by leephillips on Tuesday October 11, 2016 @09:56PM
(#12689929)
Oh no, certainly not. Sorry, I didn't realize you were asking for that, too!