Julia es un lenguaje de programación de código abierto, multiplataforma, de alto nivel y alto rendimiento para cálculo técnico.

Julia posee un compilador JIT La compilación Just-In-Time se produce en tiempo de ejecución en vez de antes de la ejecución, y ofrece la velocidad del código compilado y la flexibilidad de la interpretación. El compilador analiza el código e infiere los tipos, después de lo cual se genera el código LLVM, que a su vez se compila a código nativo. basado en una LLVM Low-Level Virtual Machine (LLVM, Máquina Virtual de Bajo Nivel), es una infraestructura de compilador para compilar código máquina binario y/o código intermedio. que permite alcanzar el rendimiento de lenguajes como C y FORTRAN sin las inconveniencias del código de bajo nivel. Debido a que el código se compila al vuelo se puede(n) ejecutar (partes de) código en una consola o REPL Read-Eval-Print-Loop (Bucle de Lectura-Evaluación-Impresión), que es parte del flujo de trabajo recomendado.

Julia utiliza tipado dinámico, proporciona despacho múltiple Por ser determinados los tipos de los argumentos de las funciones en tiempo de ejecución, el compilador consigue escojer la implementación que está optimizada para los argumentos proporcionados y la arquitectura de procesador. , y está diseñado para cálculo distribuido y paralelo.

Julia incorpora un gestor de paquetes.

Julia incorpora varias funciones matemáticas, incluidas funciones especiales (p.ej. Gamma), y soporta números complejos recién instalado.

Julia le permite generar código “automágicamente” gracias a macros inspiradas en Lisp.

Julia data de 2012.

To help Julia load faster, many core functionalities exist in standard libraries that come bundled with Julia. To make their functions available, use using PackageName. Here are some Standard Libraries and popular functions.

Packages must be registered before they are visible to the package manager. In Julia 1.0, there are two ways to work with the package manager: either with using Pkg and using Pkg functions, or by typing ] in the REPL to enter the special interactive package management mode. (To return to regular REPL, just hit BACKSPACE on an empty line in package management mode). Note that new tools arrive in interactive mode first, then usually also become available in regular Julia sessions through Pkg module.

Using Pkg in Julia session

In Interactive Package Mode

Beware of multi-byte Unicode encodings in UTF-8:
10 == lastindex("Ångström") != length("Ångström") == 8

Strings are immutable.

Julia does not automatically check for numerical overflow. Use package SaferIntegers for ints with overflow checking.

Many random number functions require using Random.

For most linear algebra tools, use using LinearAlgebra.

Julia has built-in support for matrix decompositions.

Julia tries to infer whether matrices are of a special type (symmetric, hermitian, etc.), but sometimes fails. To aid Julia in dispatching the optimal algorithms, special matrices can be declared to have a structure with functions like Symmetric , Hermitian , UpperTriangular, LowerTriangular, Diagonal , and more.

All arguments to functions are passed by reference.

Functions with ! appended change at least one argument, typically the first: sort!(arr).

Required arguments are separated with a comma and use the positional notation.

Optional arguments need a default value in the signature, defined with =.

Keyword arguments use the named notation and are listed in the function’s signature after the semicolon:

function func(req1, req2; key1=dflt1, key2=dflt2)
    # do stuff
end

The semicolon is not required in the call to a function that accepts keyword arguments.

The return statement is optional but highly recommended.

Multiple data structures can be returned as a tuple in a single return statement.

Command line arguments julia script.jl arg1 arg2... can be processed from global constant ARGS:

for arg in ARGS
    println(arg)
end

Anonymous functions can best be used in collection functions or list comprehensions: x -> x^2.

Functions can accept a variable number of arguments:

function func(a...)
    println(a)
end

func(1, 2, [3:5]) # tuple: (1, 2, UnitRange{Int64}[3:5])

Functions can be nested:

function outerfunction()
    # do some outer stuff
    function innerfunction()
        # do inner stuff
        # can access prior outer definitions
    end
    # do more outer stuff
end

Functions can have explicit return types

# take any Number subtype and return it as a String
function stringifynumber(num::T)::String where T <: Number
    return "$num"
end

Functions can be vectorized by using the Dot Syntax

# here we broadcast the subtraction of each mean value
# by using the dot operator
julia> using Statistics
julia> A = rand(3, 4);
julia> B = A .- mean(A, dims=1)
3×4 Array{Float64,2}:
  0.0387438     0.112224  -0.0541478   0.455245
  0.000773337   0.250006   0.0140011  -0.289532
 -0.0395171    -0.36223    0.0401467  -0.165713
julia> mean(B, dims=1)
1×4 Array{Float64,2}:
 -7.40149e-17  7.40149e-17  1.85037e-17  3.70074e-17

Julia generates specialized versions Multiple dispatch a type of polymorphism that dynamically determines which version of a function to call. In this context, dynamic means that it is resolved at run-time, whereas method overloading is resolved at compile time. Julia manages multiple dispatch completely in the background. Of course, you can provide custom function overloadings with type annotations. of functions based on data types. When a function is called with the same argument types again, Julia can look up the native machine code and skip the compilation process.

Since Julia 0.5 the existence of potential ambiguities is still acceptable, but actually calling an ambiguous method is an immediate error.

Stack overflow is possible when recursive functions nest many levels deep. Trampolining can be used to do tail-call optimization, as Julia does not do that automatically yet. Alternatively, you can rewrite the tail recursion as an iteration.

Dictionaries are mutable; when symbols are used as keys, the keys are immutable.

Checking whether an element is contained in a set is done in O(1).

Julia has no classes and thus no class-specific methods.

Types are like classes without methods.

Abstract types can be subtyped but not instantiated.

Concrete types cannot be subtyped.

By default, struct s are immutable.

Immutable types enhance performance and are thread safe, as they can be shared among threads without the need for synchronization.

Objects that may be one of a set of types are called Union types.

When a type is defined with an inner constructor, the default outer constructors are not available and have to be defined manually if need be. An inner constructor is best used to check whether the parameters conform to certain (invariance) conditions. Obviously, these invariants can be violated by accessing and modifying the fields directly, unless the type is defined as immutable. The new keyword may be used to create an object of the same type.

Type parameters are invariant, which means that Point{Float64} <: Point{Real} is false, even though Float64 <: Real. Tuple types, on the other hand, are covariant: Tuple{Float64} <: Tuple{Real}.

The type-inferred form of Julia’s internal representation can be found with code_typed(). This is useful to identify where Any rather than type-specific native code is generated.

Modules are separate global variable workspaces that group together similar functionality.

There is only one difference between using and import : with using you need to say function Foo.bar(.. to extend module Foo’s function bar with a new method, but with import Foo.bar, you only need to say function bar(... and it automatically extends module Foo’s function bar .

Julia is homoiconic: programs are represented as data structures of the language itself. In fact, everything is an expression Expr.

Symbols are interned strings Only one copy of each distinct (immutable) string value is stored. prefixed with a colon. Symbols are more efficient and they are typically used as identifiers, keys (in dictionaries), or columns in data frames. Symbols cannot be concatenated.

Quoting :( ... ) or quote ... end creates an expression, just like parse(str) This form is probably most familiar to people with knowledge of dynamic SQL. The parse function is similar to Oracle”s and PostgreSQL”s EXECUTE IMMEDIATE statement or SQL Server’s sp_executesql() procedure. , and Expr(:call, ...).

x = 1
line = "1 + $x"      # some code
expr = parse(line)   # make an Expr object
typeof(expr) == Expr # true
dump(expr)           # generate abstract syntax tree
eval(expr) == 2      # evaluate Expr object: true

Macros allow generated code (i.e. expressions) to be included in a program.

Rules for creating hygienic macros:

• Declare variables inside macro with local .
• Do not call eval inside macro.
• Escape interpolated expressions to avoid expansion: $(esc(expr))

Parallel computing tools are available in the Distributed standard library.

Workers are also known as concurrent/parallel processes.

Modules with parallel processing capabilities are best split into a functions file that contains all the functions and variables needed by all workers, and a driver file that handles the processing of data. The driver file obviously has to import the functions file.

A non-trivial (word count) example of a reducer function is provided by Adam DeConinck.

For dplyr-like tools, see DataFramesMeta.jl.

Many core packages are managed by communities with names of the form Julia[Topic].

The main convention in Julia is to avoid underscores unless they are required for legibility.

Variable names are in lower (or snake) case: somevariable.

Constants are in upper case: SOMECONSTANT.

Functions are in lower (or snake) case: somefunction.

Macros are in lower (or snake) case: @somemacro.

Type names are in initial-capital camel case: SomeType.

Julia files have the jl extension.

For more information on Julia code style visit the manual: style guide .

• Write type-stable code.
• In fact, use immutable types where possible.
• Use sizehint for large arrays.
• Free up memory for large arrays with arr = nothing.
• Access arrays along columns, because multi-dimensional arrays are stored in column-major order.
• Pre-allocate resultant data structures.
• Disable the garbage collector in real-time applications: disable_gc().
• Avoid the splat (...) operator for keyword arguments.
• Use mutating APIs (i.e. functions with ! to avoid copying data structures.
• Use array (element-wise) operations instead of list comprehensions.
• Avoid try-catch in (computation-intensive) loops.
• Avoid Any in collections.
• Avoid abstract types in collections.
• Avoid string interpolation in I/O.
• Vectorizing does not improve speed (unlike R, MATLAB or Python).
• Avoid eval at run-time.

• Juno (editor)
• Jupyter (online IJulia notebook)
• Pluto.jl (online IJulia notebook)
• Emacs Julia mode (editor)
• vim Julia mode (editor)
• VS Code extension (editor)

• Official documentation .
• Learning Julia page.
• Month of Julia
• Community standards .
• Julia: A fresh approach to numerical computing (pdf)
• Julia: A Fast Dynamic Language for Technical Computing (pdf)

• The 10th annual JuliaCon 2023
• The 10th annual JuliaCon 2023 Pre-recorded videos
• The 9th annual JuliaCon 2022
• The 8th annual JuliaCon 2021
• The 7th annual JuliaCon 2020
• The 6th annual JuliaCon 2019
• The 5th annual JuliaCon 2018
• The 4th annual JuliaCon 2017 (Berkeley)
• The 3rd annual JuliaCon 2016
• Getting Started with Julia by Leah Hanson
• Intro to Julia by Huda Nassar
• Introduction to Julia for Pythonistas by John Pearson