Meet Patel
2016-08-26 22:59:58 UTC
Ok, so I was watching this
talk, and about 1:21:00 into
the talk, the speaker, David Sanders states that Julia is inefficient at
passing functions around. He said that the reason for this was because
Julia has to do a type inference for each part of the function. What if the
developer can type the function, like in Haskell.
In Haskell, we can have a type annotation like this:
adder :: Int -> Int
and this would symbolize a function that takes in an Integer and returns an
Integer. What if a system in Julia was implemented that would do the same
(or similar) thing. This would remove the need for the compiler to infer
the types of each part of the function.
Sorry, in advance, if anything I said in this post was stupid, as I am just
learning Julia.
talk, and about 1:21:00 into
the talk, the speaker, David Sanders states that Julia is inefficient at
passing functions around. He said that the reason for this was because
Julia has to do a type inference for each part of the function. What if the
developer can type the function, like in Haskell.
In Haskell, we can have a type annotation like this:
adder :: Int -> Int
and this would symbolize a function that takes in an Integer and returns an
Integer. What if a system in Julia was implemented that would do the same
(or similar) thing. This would remove the need for the compiler to infer
the types of each part of the function.
Sorry, in advance, if anything I said in this post was stupid, as I am just
learning Julia.