Abstract
We present an implementation of the TransLucid language, in which expressions are evaluated in a dynamic context of arbitrary dimensionality. The basis for this implementation is the TransLucid Virtual Machine (TVM), whose execution supposes a centralised cache storing intermediate computed values and whose individual threads compute the values for (identifier, context) pairs. The TVM is designed so that it is efficiently implementable on a wide variety of physical architectures. © 2008 IEEE.