Julia: A Fast Dynamic Language for Technical Computing · HackerPapers discussions

Julia: A Fast Dynamic Language for Technical Computing — mentioned by StefanKarpinski

Fri, 10 Aug 2018 01:00:49 GMT

> I was watching live stream last night from the East coast and very impressed by the achievement by you scientists and grad students since 2012. https://arxiv.org/abs/1209.5145 Thank you, that's very kind of you! To be fair, Jeff, Viral, Alan and I had many collective decades of industry experience interleaved with an equal amount of academia by the time we wrote that paper. And of course the academics are rather suspicious about just how academic we really are. > We need more crazy meta programmers. Hear, hear!

Paper and discussion history. A mention is not an endorsement.

Julia: A Fast Dynamic Language for Technical Computing — mentioned by ontouchstart

Thu, 09 Aug 2018 18:19:36 GMT

I was watching live stream last night from the East coast and very impressed by the achievement by you scientists and grad students since 2012. https://arxiv.org/abs/1209.5145 As a former physicist, I have been through the Numerical Recipes/F77 stage myself two decades ago. In the age of Big Data and Machine Learning, there are many ways to harvest the creativities in people who are not trained as professional engineers. Our software development mindset should be extended beyond the industrial "task oriented" products and platforms. In the spirit of Turing machine and LISP where code is also…

Paper and discussion history. A mention is not an endorsement.

Julia: A Fast Dynamic Language for Technical Computing — mentioned by StefanKarpinski

Mon, 30 Nov 2015 00:15:37 GMT

Between this post and others like it [1], Maxime Chevalier-Boisvert's ideas sound like they're evolving towards something very much like Julia [2], a dynamic language carefully designed to make ahead-of-time data-flow-based type analysis easy. This analysis allows Julia to achieve performance comparable to C and Fortran. Much of the design involves selecting which aspects of traditional unrestricted dynamism can be given up without compromising usability. For example, function bindings are constant by default, which allows type inference to know with certainty which function object is being…

Paper and discussion history. A mention is not an endorsement.

Julia: A Fast Dynamic Language for Technical Computing — mentioned by StefanKarpinski

Sat, 08 Nov 2014 10:54:59 GMT

Despite having a very similar title, this is a rather different paper from http://arxiv.org/abs/1209.5145. We had to upload a version of this paper for a grant application, but it's still somewhat in progress.

Paper and discussion history. A mention is not an endorsement.

Julia: A Fast Dynamic Language for Technical Computing — mentioned by StefanKarpinski

Tue, 16 Apr 2013 18:10:35 GMT

Thanks for checking Julia out. I fear there is a fair amount of misinformation in your comment, however, so it seems that a few things were lost in your reading of Julia's code (some of which is admittedly quite tricky). I hope you don't mind if I address some of it. The first point is that Julia already has excellent performance on a par with most compiled languages, including, e.g. Haskell, whether they are using LLVM or not. Straight-forward Julia code is typically within a factor of two of C. That's shown in the microbenchmarks on Julia's web site [http://julialang.org/], but, of course…

Paper and discussion history. A mention is not an endorsement.

Julia: A Fast Dynamic Language for Technical Computing — mentioned by ViralBShah

Wed, 03 Apr 2013 07:04:02 GMT

The language is carefully constrained so that type inference can work in the majority of the cases, allowing efficient code generation. The details are in our julia design paper here. http://arxiv.org/abs/1209.5145 Also, a number of other language features include: `ccall` to make it easy to call C and Fortran libraries, multiple dispatch which is already discussed here, real metaprogramming capabilities which have traditionally been considered optional in this class of languages, keyword arguments (coming soon), coroutines (julia Tasks) which integrate nicely with the asynchronous networking…

Paper and discussion history. A mention is not an endorsement.