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
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.
Integrity signals
Registry
Cites
Statistics
Figures
















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.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Here, we describe how a long-term partnership to improve Circuitscape supported rapid growth in the tool's use, and also helped inspire a new high-performance programming language called Julia [32,33], which is now empowering the most recent Circuitscape release.”
From Circuitscape in julia: empowering dynamic approaches to connectivity assessment (2021) · cites this paper as [32]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“First publicly released in 2012, the Julia programming language is still in rapid development [32,33] and was, in part, inspired by Shah's experience collaborating with McRae to create a powerful yet accessible tool for biodiversity conservation applications.”
From Circuitscape in julia: empowering dynamic approaches to connectivity assessment (2021) · cites this paper as [32]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Often, a software tool may be first created in a high-productivity dynamically typed language, and as the tool matures and needs more performance and scale (ability to maintain performance as the problem size increases), it may be converted to a highperformance statically typed language [32,33].”
From Circuitscape in julia: empowering dynamic approaches to connectivity assessment (2021) · cites this paper as [32]
The cited source says what the claim attributes to it.
In the citing paper
“In general, the more information the system has about a program's data inputs, the faster a program can run.”
From Circuitscape in julia: empowering dynamic approaches to connectivity assessment (2021) · cites this paper as [32]
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
R: A Language and Environment for Statistical Computing
R Core Team (2025) · doi:10.32614/r.manuals · Cited by 352,181
Julia: A Fresh Approach to Numerical Computing
Bezanson, J., Edelman, A., Karpinski, S., & Shah, V. B. (2017) · SIAM Review · doi:10.1137/141000671 · Cited by 5,440
Self-citationX10: an object-oriented approach to non-uniform cluster computing
Charles, P., Grothoff, C., Saraswat, V., Donawa, C., Kielstra, A., Ebcioglu, K., von Praun, C., & Sarkar, V. (2005) · Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/1094811.1094852 · Cited by 1,268
Julia: A Fast Dynamic Language for Technical Computing
Anderson, T. A., Liu, H., Kuper, L., Totoni, E., Vitek, J., & Shpeisman, T. (2012) · arXiv (Cornell University) · doi:10.4230/lipics.ecoop.2017.4 · Cited by 627
Self-citationEncyclopedia of Parallel Computing
(2011) · Springer eBooks · doi:10.1007/978-0-387-09766-4 · Cited by 589
Siek, J. G., & Taha, W. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73589-2_2 · Cited by 403
Computing in Operations Research Using Julia
Lubin, M., & Dunning, I. (2015) · INFORMS journal on computing · doi:10.1287/ijoc.2014.0623 · Cited by 320
The design and implementation of typed scheme
Tobin-Hochstadt, S., & Felleisen, M. (2008) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1328438.1328486 · Cited by 314
X10: an object-oriented approach to non-uniform cluster computing
Charles, P., Grothoff, C., Saraswat, V., Donawa, C., Kielstra, A., Ebcioglu, K., von Praun, C., & Sarkar, V. (2005) · ACM SIGPLAN Notices · doi:10.1145/1103845.1094852 · Cited by 301
Würthinger, T., Wimmer, C. L., Wöß, A., Stadler, L., Duboscq, G., Humer, C., Richards, G., Simon, D., & Wolczko, M. (2013) · doi:10.1145/2509578.2509581 · Cited by 296
The java hotspot TM server compiler
Paleczny, M. H., Vick, C. A., & Click, C. (2001) · Cited by 264
Type inclusion constraints and type inference
Aiken, A., & Wimmers, E. L. (1993) · Proceedings of the conference on Functional programming languages and computer architecture · doi:10.1145/165180.165188 · Cited by 262
Optimizing dynamically-dispatched calls with run-time type feedback
Hölzle, U., & Ungar, D. (1994) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/178243.178478 · Cited by 262
Interlanguage migration: from scripts to programs
Tobin-Hochstadt, S., & Felleisen, M. (2006) · Companion to the 21st ACM SIGPLAN symposium on Object-oriented programming systems, languages, and applications · doi:10.1145/1176617.1176755 · Cited by 206
European conference on object-oriented programming on ECOOP '87
Bézivín, J., Hullot, J.-M., Cointe, P., & Lieberman, H. A. (1987) · Cited by 171
CommonLoops: merging Lisp and object-oriented programming
Bobrow, D. G., Kahn, K., Kiczales, G., Masinter, L. M., Stefik, M., & Zdybel, F. (1986) · doi:10.1145/28697.28700 · Cited by 139
The Common Lisp Object System: An Overview
DeMichiel, L. G., & Gabriel, R. P. (1987) · Lecture notes in computer science · doi:10.1007/3-540-47891-4_15 · Cited by 138
Fast and precise hybrid type inference for JavaScript
Hackett, B., & Guo, S. (2012) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2254064.2254094 · Cited by 129
A practical soft type system for scheme
Wright, A. K., & Cartwright, R. (1997) · ACM Transactions on Programming Languages and Systems · doi:10.1145/239912.239917 · Cited by 104
Techniques for the translation of MATLAB programs into Fortran 90
Rose, L. D., & Padua, D. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/316686.316693 · Cited by 101
Frisch, A., Castagna, G., & Benzaken, V. (2003) · Proceedings - Symposium on Logic in Computer Science · doi:10.1109/lics.2002.1029823 · Cited by 97
Optimizing Matlab through Just-In-Time Specialization
Chevalier-Boisvert, M., Hendren, L. J., & Verbrugge, C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11970-5_4 · Cited by 67
RATA: Rapid Atomic Type Analysis by Abstract Interpretation – Application to JavaScript Optimization
Logozzo, F., & Venter, H. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11970-5_5 · Cited by 55
Bloom, B., Field, J., Nystrom, N., Östlund, J., Richards, G., Strniša, R., Vítek, J., & Wrigstad, T. (2009) · ACM SIGPLAN Notices · doi:10.1145/1639949.1640098 · Cited by 54
Muschevici, R., Potanin, A., Tempero, E. D., & Noble, J. (2008) · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · doi:10.1145/1449764.1449808 · Cited by 48
Fast and precise type checking for JavaScript
Chaudhuri, A., Vekris, P., Goldman, S., Roch, M., & Levi, G. (2017) · Proceedings of the ACM on Programming Languages · doi:10.1145/3133872 · Cited by 46
A fast abstract syntax tree interpreter for R
Kalibera, T., Maj, P., Morandat, F., & Vítek, J. (2014) · ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments (VEE) · doi:10.1145/2576195.2576205 · Cited by 44
Bloom, B., Field, J., Nystrom, N., Östlund, J., Richards, G., Strniša, R., Vítek, J., & Wrigstad, T. (2009) · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · doi:10.1145/1640089.1640098 · Cited by 42
Optimizing dynamically-dispatched calls with run-time type feedback
Hölzle, U., & Ungar, D. (1994) · ACM SIGPLAN Notices · doi:10.1145/773473.178478 · Cited by 41
Talbot, J., DeVito, Z., & Hanrahan, P. (2012) · International Conference on Parallel Architectures and Compilation Techniques · doi:10.1145/2370816.2370825 · Cited by 40
Data-flow analysis and type recovery in Scheme
Shivers, O. (2018) · KiltHub Repository · doi:10.1184/r1/6604622 · Cited by 38
Topics in advanced language implementation
Tracey, S. (1992) · Information and Software Technology · doi:10.1016/0950-5849(92)90151-e · Cited by 35
Object-Oriented Programming, Functional Programming and RPreprint
Chambers, J. M. (2016) · Cited by 33
Julia subtyping: a rational reconstruction
Nardelli, F. Z., Belyakova, J., Pelenitsyn, A., Chung, B., Bezanson, J., & Vítek, J. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3276483 · Cited by 31
Self-citationContraint-based polymorphism in Cecil
Litvinov, V. (1998) · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · doi:10.1145/286936.286979 · Cited by 29
Soft typing: an approach to type checking for dynamically typed languages
Fagan, M. (1992) · Rice Research Repository (Rice University) · Cited by 27
Type checking modular multiple dispatch with parametric polymorphism and multiple inheritance
Allen, E., Hilburn, J., Kilpatrick, S., Luchangco, V., Ryu, S., Chase, D. R., & Steele, G. L. (2011) · ACM International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA) · doi:10.1145/2048066.2048140 · Cited by 14
Randal, A. (2004) · Cited by 13
A practical soft type system for Scheme
Wright, A. K., & Cartwright, R. (1994) · ACM SIGPLAN Lisp Pointers · doi:10.1145/182590.182485 · Cited by 10
Design and implementation of an efficient hybrid dynamic and static typing language
García, M., Ortín, F., & Quiroga, J. (2014) · Software Practice and Experience · doi:10.1002/spe.2291 · Cited by 9
Bloom, B., Field, J., Nystrom, N., Östlund, J., Richards, G., Strniša, R., Vítek, J., & Wrigstad, T. (2009) · doi:10.1145/1639950.1640016 · Cited by 3
Research works printed but not linked: 4
- 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).
- 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).
- MATLAB. 2018. version 9.4 . The MathWorks Inc., Natick, Massachusetts . MATLAB. 2018. version 9.4. The MathWorks Inc., Natick, Massachusetts.
- 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
Circuitscape in julia: empowering dynamic approaches to connectivity assessment
Hall, K. R., Anantharaman, R., Landau, V. A., Clark, M., Dickson, B. G., Jones, A., Platt, J., Edelman, A., & Shah, V. B. (2021) · Land · doi:10.3390/land10030301 · Cited by 115
Self-citation
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
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.