Abstract
We show how expressions written in a functional programming language can be robustly evaluated on a modular asynchronous spatial computer by compiling them into a distributed virtual machine comprised of reified bytecodes undergoing diffusion and communicating via messages containing encapsulated virtual machine states. Because the semantics of the source language are purely functional, multiple instances of each reified bytecode and multiple execution threads can coexist without inconsistency in the same distributed heap. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Williams, L. R. (2012). Robust evaluation of expressions by distributed virtual machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7445 LNCS, pp. 222–233). Springer Verlag. https://doi.org/10.1007/978-3-642-32894-7_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
