Sal/Svm: an assembly language and virtual machine for computing with non-enumerated sets
Phillip Stanley-Marbell IBM Research---Zürich, Säumerstrasse, Rüschlikon, Switzerland
Abstract
Presented is the design, implementation and evaluation of a system for computing with non-enumerative set representations. The implementation is in the form of a set assembly language (Sal) whose operations correspond to an implementation of the algebra of sets, with minimal added syntactic sugar; a compiler (Salc) for validation and static optimization of Sal definitions; and a virtual machine architecture (Svm) for executing Sal definitions.
Sal/Svm has turned out to be a surprisingly versatile framework for a growing number of problems. One such application, as a framework for declaratively specifying computational problems with the same level of precision that traditional machine languages enable the specification of computational algorithms, is presented.
Cite as:
Phillip Stanley-Marbell. 2010. Sal/Svm: an assembly language and virtual machine for computing with non-enumerated sets. In Virtual Machines and Intermediate Languages (VMIL '10). Association for Computing Machinery, New York, NY, USA, Article 1, 1–10. DOI:https://doi.org/10.1145/1941054.1941055
BibTeX:
@inproceedings{10.1145/1941054.1941055,
author = {Stanley-Marbell, Phillip},
title = {Sal/Svm: An Assembly Language and Virtual Machine for Computing with Non-Enumerated Sets},
year = {2010},
isbn = {9781450305457},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1941054.1941055},
doi = {10.1145/1941054.1941055},
booktitle = {Virtual Machines and Intermediate Languages},
articleno = {1},
numpages = {10},
keywords = {set theory, declarative problem specification, virtual machines, languages for future device technologies},
location = {Reno, Nevada},
series = {VMIL '10}
}
