Maxwell equations of software? or rather Feynman diagrams of software? crossing fingers that some of this is true 🙂
*High-order Virtual Machine (HVM)
is a pure functional runtime that is lazy
and massively parallel
. It is also beta-optimal
, meaning that, for higher-order computations, it can be exponentially faster than alternatives, including Haskell's GHC.
That is possible due to a new model of computation, the Interaction Net
, which supersedes the Turing Machine
and the Lambda Calculus
. Previous implementations of this model have been inefficient in practice, however, a recent breakthrough has drastically improved its efficiency, resulting in the HVM. Despite being relatively new, it already beats mature compilers in many cases, and is set to scale towards uncharted levels of performance.
Welcome to the massively parallel future of computers!
Interaction Combinators Paper
It is shown that a very simple system of interaction combinators
, with only three symbols and six rules, is a universal model of distributed computation, in a sense that will be made precise. This paper is the continuation of the author's work on interaction nets
, inspired by Girard's proof nets for linear logic
, but no preliminary knowledge of these topics is required for its reading.
are a graphical model of computation
devised by Yves Lafont
in 1990 as a generalisation of the proof structures of linear logic
. An interaction net system is specified by a set of agent types and a set of interaction rules. Interaction nets are an inherently distributed model of computation in the sense that computations can take place simultaneously in many parts of an interaction net, and no synchronisation is needed. The latter is guaranteed by the strong confluence property of reduction in this model of computation. Thus interaction nets provide a natural language for massive parallelism.