and partly because of a strong focus on performance from the inception of the project, Julia's computational efficiency exceeds that of other dynamic languages, and even rivals that of statically-compiled that are natively supported on modern computers, thus allowing Julia to take full advantage of computational resources. Additionally, Julia provides software support for Arbitrary Precision Arithmetic, all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. • There is no meaningful concept of a "compile-time

and partly because of a strong focus on performance from the inception of the project, Julia's computational efficiency exceeds that of other dynamic languages, and even rivals that of statically-compiled that are natively supported on modern computers, thus allowing Julia to take full advantage of computational resources. Additionally, Julia provides software support for Arbitrary Precision Arithmetic, all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. • There is no meaningful concept of a "compile-time

and partly because of a strong focus on performance from the inception of the project, Julia's computational efficiency exceeds that of other dynamic languages, and even rivals that of statically-compiled that are natively supported on modern computers, thus allowing Julia to take full advantage of computational resources. Additionally, Julia provides software support for Arbitrary Precision Arithmetic, all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. • There is no meaningful concept of a "compile-time

and partly because of a strong focus on performance from the inception of the project, Julia's computational efficiency exceeds that of other dynamic languages, and even rivals that of statically-compiled that are natively supported on modern computers, thus allowing Julia to take full advantage of computational resources. Additionally, Julia provides software support for Arbitrary Precision Arithmetic, all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. • There is no meaningful concept of a "compile-time

and partly because of a strong focus on performance from the inception of the project, Julia's computational efficiency exceeds that of other dynamic languages, and even rivals that of statically-compiled that are natively supported on modern computers, thus allowing Julia to take full advantage of computational resources. Additionally, Julia provides software support for Arbitrary Precision Arithmetic, all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. • There is no meaningful concept of a "compile-time

and partly because of a strong focus on performance from the inception of the project, Julia's computational efficiency exceeds that of other dynamic languages, and even rivals that of statically-compiled that are natively supported on modern computers, thus allowing Julia to take full advantage of computational resources. Additionally, Julia provides software support for Arbitrary Precision Arithmetic, all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. • There is no meaningful concept of a "compile-time

and partly because of a strong focus on performance from the inception of the project, Julia's computational efficiency exceeds that of other dynamic languages, and even rivals that of statically-compiled that are natively supported on modern computers, thus allowing Julia to take full advantage of computational resources. Additionally, Julia provides software support for Arbitrary Precision Arithmetic, all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. • There is no meaningful concept of a "compile-time

and partly because of a strong focus on performance from the inception of the project, Julia's computational efficiency exceeds that of other dynamic languages, and even rivals that of statically-compiled that are natively supported on modern computers, thus allowing Julia to take full advantage of computational resources. Additionally, Julia provides software support for Arbitrary Precision Arithmetic, all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. • There is no meaningful concept of a "compile-time

and partly because of a strong focus on performance from the inception of the project, Julia's computational efficiency exceeds that of other dynamic languages, and even rivals that of statically-compiled that are natively supported on modern computers, thus allowing Julia to take full advantage of computational resources. Additionally, Julia provides software support for Arbitrary Precision Arithmetic, all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. • There is no meaningful concept of a "compile-time

and partly because of a strong focus on performance from the inception of the project, Julia's computational efficiency exceeds that of other dynamic languages, and even rivals that of statically-compiled that are natively supported on modern computers, thus allowing Julia to take full advantage of computational resources. Additionally, Julia provides software support for Arbitrary Precision Arithmetic, all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. • There is no meaningful concept of a "compile-time