Towards an Effcient Implementation of Distributive Programs

Programs and data in distributive categories must be coded in some way in order to be executed on standard archi- tectures. 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.

Content

Author and article information

Conference

Publication date: September 1997

Publication date (Print): September 1997

Pages: 1-10

Affiliations

[0001]Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano

Milano, Italy

Article

DOI: 10.14236/ewic/AL1997.13

SO-VID: 52431a5c-8743-4c4d-a824-f136fb484c6a

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Proceedings of the 2nd International Workshop on the Theory and Practice of Algebraic Specifications

Conference acronym: AS

Conference number: 2

Conference location: Amsterdam

Conference date: 25-26 September 1997

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Theory and Practice of Algebraic Specifications

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/AL1997.13

Self URI (journal page): https://ewic.bcs.org/

Celebrating 65 years of The Computer Journal - free-to-read perspectives - bcs.org/tcj65

Towards an Effcient Implementation of Distributive Programs

Abstract