Julia: A Fresh Approach to Numerical Computing | SIAM Review | Vol. 59, No. 1 | Society for Industrial and Applied Mathematics

Bridging cultures that have often been distant, Julia combines expertise from the diverse fields of computer science and computational science to create a new approach to numerical computing. Julia is designed to be easy and fast and questions notions generally held to be “laws of nature” by practitioners of numerical computing: 1. High-level dynamic programs have to be slow. 2. One must prototype in one language and then rewrite in another language for speed or deployment. 3. There are parts of a system appropriate for the programmer, and other parts that are best left untouched as they have been built by the experts. We introduce the Julia programming language and its design—a dance between specialization and abstraction. Specialization allows for custom treatment. Multiple dispatch, a technique from computer science, picks the right algorithm for the right circumstance. Abstraction, which is what good computation is really about, recognizes what remains the same after differences are stripped away. Abstractions in mathematics are captured as code through another technique from computer science, generic programming. Julia shows that one can achieve machine performance without sacrificing human convenience.

[1]  Charles L. Lawson,et al.  Basic Linear Algebra Subprograms for Fortran Usage , 1979, TOMS.

[2]  Jeffrey D. Ullman,et al.  A Scheme for the Automatic Inference of Variable Types , 1980, JACM.

[3]  G. Strang.  Introduction to Linear Algebra , 1993 .

[4]  Ross Ihaka,et al.  Gentleman R: R: A language for data analysis and graphics , 1996 .

[5]  Claude Gomez,et al.  Engineering and Scientific Computing with Scilab , 1998 .

[6]  Jack Dongarra,et al.  LAPACK Users' Guide, 3rd ed. , 1999 .

[7]  Markus Mohnen,et al.  A Graph-Free Approach to Data-Flow Analysis , 2002, CC.

[8]  Vikram S. Adve,et al.  LLVM: a compilation framework for lifelong program analysis & transformation , 2004, International Symposium on Code Generation and Optimization, 2004. CGO 2004..

[9]  Alan Edelman,et al.  Parallel MATLAB: Doing it Right , 2005, Proceedings of the IEEE.

[10]  Leland Wilkinson,et al.  The Grammar of Graphics (Statistics and Computing) , 2005 .

[11]  James Demmel,et al.  Prospectus for the Next LAPACK and ScaLAPACK Libraries , 2006, PARA.

[12]  A. Edelman,et al.  From Random Matrices to Stochastic Operators , 2006, math-ph/0607038.

[13]  Ewan D. Tempero,et al.  Multiple dispatch in practice , 2008, OOPSLA.

[14]  Gaël Varoquaux,et al.  The NumPy Array: A Structure for Efficient Numerical Computation , 2011, Computing in Science & Engineering.

[15]  Alan Edelman,et al.  Julia: A Fast Dynamic Language for Technical Computing , 2012, ArXiv.

[16]  Helen Shen,et al.  Interactive notebooks: Sharing the code , 2014, Nature.

[17]  Stephen P. Boyd,et al.  Convex Optimization in Julia , 2014, 2014 First Workshop for High Performance Technical Computing in Dynamic Languages.

[18]  Alan Edelman,et al.  Array Operators Using Multiple Dispatch: A design methodology for array implementations in dynamic languages , 2014, ARRAY@PLDI.

[19]  Jeff Bezanson,et al.  Abstraction in technical computing , 2015 .

[20]  Iain Dunning,et al.  Computing in Operations Research Using Julia , 2013, INFORMS J. Comput..