Between this post and others like it [1], Maxime Chevalier-Boisvert's ideas sound like they're evolving towards something very much like Julia [2], a dynamic la

Between this post and others like it [1], Maxime Chevalier-Boisvert's ideas sound like they're evolving towards something very much like Julia [2], a dynamic language carefully designed to make ahead-of-time data-flow-based type analysis easy. This analysis allows Julia to achieve performance comparable to C and Fortran. Much of the design involves selecting which aspects of traditional unrestricted dynamism can be given up without compromising usability. For example, function bindings are constant by default, which allows type inference to know with certainty which function object is being called in most function calls. Similarly, since much of the difficulty in optimizing dynamic languages comes from trying to guess the types in arrays/structures/objects, Julia allows programmers to specify these, thereby eliminating this difficulty entirely. More information about Julia's design and implementation can be found here [3]. [1] http://pointersgonewild.com/2012/11/09/static-vs-dynamic-why-not-both/ http://pointersgonewild.com/2012/11/09/static-vs-dynamic-why... [2] http://julialang.org/ http://julialang.org/ [3] http://arxiv.org/abs/1209.5145 http://arxiv.org/abs/1209.5145