Amorphous Infrastructure for Language Implementation
Author(s)
Newton, Ryan; Beal, Jacob![Thumbnail](/bitstream/handle/1721.1/31221/MIT-CSAIL-TR-2006-015.pdf.jpg?sequence=4&isAllowed=y)
DownloadMIT-CSAIL-TR-2006-015.ps (20930Kb)
Additional downloads
Other Contributors
Mathematics and Computation
Advisor
Gerald Sussman
Metadata
Show full item recordAbstract
We propose a method for the robust implementation of simple graphical automataon an amorphous computer. This infrastructure is applied to the implementationof purely functional programming languages. Specifically, it is usedin conjunction with data-flow techniques to implement a toy language homologousto recurrence equations, exploiting control-flow parallelism through paralleloperand evaluation. Also, data parallelism is explored in a separate implementation,in which a simple mark-up syntax enables Scheme programs to performspatially-distributed tree-walking without modifying their semantics. This additionenables an idiomatically expressed interpreter to be trivially instrumented,producing a spatially distributed universal machine, and once again achievingcontrol flow parallelism in the interpreted language.
Date issued
2002-12-10Citation
6.978 Final Project
Other identifiers
MIT-CSAIL-TR-2006-015
Series/Report no.
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory