The Computer Journal
Introducing a calculus of trees
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Literate programming
A meta-environment for generating programming environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
On the relations between distributive computability and the BSS model
Theoretical Computer Science - Special issue on real numbers and computers
Communications of the ACM
| Hi-index | 0.00 |
Programs and data in distributive categories must be coded in some way in order to be executed on standard architectures. In the original mathematical description of an IMP.G/ interpreter [KW93] distributive data were coded as words on a suitable set. We present a new efficient coding for such data. This coding allows to exploit the known techniques used in run-time environments for object-oriented systems in order to optimize the execution of IMP.G/ programs on RAM machines. Moreover, the coding is at the basis of a compiler and bytecode interpreter, which have been described equationally using ASF+SDF.