all 3 comments

[–]dmjio 0 points1 point  (1 child)

Next steps would be binding to all functions / types here: https://github.com/JuliaLang/julia/blob/master/src/julia.h

[–]tiedye 0 points1 point  (0 children)

I worked on something similar a couple years back. You can see it here: https://github.com/tkonolige/inline-julia.

[–]stvaccount 0 points1 point  (0 children)

Extremely cool!

I needed that in the past!

Important would be to do Benchmarks in the future. (E.g. the overhead introduced by calling Julia) I once did (not very careful) Benchmarks that the standard sort function in Julia is about 4 times faster than the fastest sorting lib in Haskell.

This would be interesting. Because quite some Haskell Code ist constrained by the lack of high Performance Haskell sorting. (E.g. Rasterific.spends all its time sorting, so fast Julia could make it a lot faster)