Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 92

The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.

Julia: dynamism and performance reconciled by design

Bezanson, Jeff, Chen, Jiahao, Chung, Benjamin, Karpinski, Stefan, Shah, Viral B., Vitek, Jan, Zoubritzky, Lionel·2018·Proceedings of the ACM on Programming Languages

Abstract

Julia is a programming language for the scientific community that combines features of productivity languages, such as Python or MATLAB, with characteristics of performance-oriented languages, such as C++ or Fortran. Julia's productivity features include: dynamic typing, automatic memory management, rich type annotations, and multiple dispatch. At the same time, Julia allows programmers to control memory layout and leverages a specializing just-in-time compiler to eliminate much of the overhead of those features. This paper details the design choices made by the creators of Julia and reflects on the implications of those choices for performance and usability.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3276490

Cites

41 of 41 references verified0 citation errors · 0 not checkable

Statistics

Figures

Image 1
CC-BY · From the PDF
Fig. 7 Slowdown of Julia, JavaScript, and Python relative to C
Fig. 7 Slowdown of Julia, JavaScript, and Python relative to CCC-BY · From the PDF
Image 3
CC-BY · From the PDF
Fig. 8 Julia JIT compiler
Fig. 8 Julia JIT compilerCC-BY · From the PDF
Image 5
CC-BY · From the PDF
Image 6
CC-BY · From the PDF
Fig. 13 Methods by percentage of typed arguments
Fig. 13 Methods by percentage of typed argumentsCC-BY · From the PDF
Fig. 12 Number of methods and types by package
Fig. 12 Number of methods and types by packageCC-BY · From the PDF
Fig. 14 Targets per call site per package
Fig. 14 Targets per call site per packageCC-BY · From the PDF
Fig. 17 Functions by arguments dispatched on of the function is in most of the cases enough to determine the corresponding method.
Fig. 17 Functions by arguments dispatched on of the function is in most of the cases enough to determine the corresponding method.CC-BY · From the PDF
Fig. 16 Dispatch ratio with soft vs. strict elimination
Fig. 16 Dispatch ratio with soft vs. strict eliminationCC-BY · From the PDF
Fig. 18 Packages by % of overloaded functions
Fig. 18 Packages by % of overloaded functionsCC-BY · From the PDF
Fig. 19 Function overloads by category
Fig. 19 Function overloads by categoryCC-BY · From the PDF
Fig. 20 Number of specializations per method
Fig. 20 Number of specializations per methodCC-BY · From the PDF
Fig. 21 Applicable methods per call signature
Fig. 21 Applicable methods per call signatureCC-BY · From the PDF
Fig. 22 Optimization and performance
Fig. 22 Optimization and performanceCC-BY · From the PDF

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 41 references

Research works printed but not linked: 4

  1. Benjamin Chung and Paley Li. 2017. Towards Typing Julia. In The -2th Workshop on New Object-Oriented Languages (NOOL). Benjamin Chung and Paley Li. 2017. Towards Typing Julia. In The -2th Workshop on New Object-Oriented Languages (NOOL).
  2. Chris Lattner and Vikram Adve . 2004 . LLVM: A Compilation Framework for Lifelong Program Analysis and Transformation. In Symposium on Code Generation and Optimization (CGO). Chris Lattner and Vikram Adve. 2004. LLVM: A Compilation Framework for Lifelong Program Analysis and Transformation. In Symposium on Code Generation and Optimization (CGO).
  3. MATLAB. 2018. version 9.4 . The MathWorks Inc., Natick, Massachusetts . MATLAB. 2018. version 9.4. The MathWorks Inc., Natick, Massachusetts.
  4. Jeremy Siek . 2006 . Gradual Typing for Functional Languages. In Scheme and Functional Programming Workshop. http: //ecee.colorado.edu/~siek/pubs/pubs/2006/siek06_gradual.pdf . Jeremy Siek. 2006. Gradual Typing for Functional Languages. In Scheme and Functional Programming Workshop. http: //ecee.colorado.edu/~siek/pubs/pubs/2006/siek06_gradual.pdf .

Cited by

See all 92

Metadata

Authors
Bezanson, J., Chen, J., Chung, B., Karpinski, S., Shah, V. B., Vitek, J., & Zoubritzky, L.
Affiliations
  • Julia Computing, USA
  • Capital One, USA
  • Northeastern University, USA
  • Czech Technical University, Czechia / Northeastern University, USA
  • ENS, France / Northeastern University, USA
Venue
Proceedings of the ACM on Programming Languages
Published
2018-10-24
Volume
2
Issue
OOPSLA
Pages
1-23
ISSN
2475-1421
Cited by
92
References
41
Language
en
Funders
  • National Science Foundation (1518844, 1544542)
  • Office of Naval Research (503353)
  • European Research Council (695412)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Julia: dynamism and performance reconciled by design. https://app.cochat.ai/papers/10.1145/3276490
The paper
Bezanson, J., Chen, J., Chung, B., Karpinski, S., Shah, V. B., Vitek, J., & Zoubritzky, L. (2018). Julia: dynamism and performance reconciled by design. Proceedings of the ACM on Programming Languages. https://doi.org/10.1145/3276490

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.