Amorphous Infrastructure for Language Implementation
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 homolog...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://hdl.handle.net/1721.1/31221 |
| _version_ | 1826207849705897984 |
|---|---|
| author | Newton, Ryan Beal, Jacob |
| author2 | Gerald Sussman |
| author_facet | Gerald Sussman Newton, Ryan Beal, Jacob |
| author_sort | Newton, Ryan |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T13:55:55Z |
| id | mit-1721.1/31221 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:55:55Z |
| publishDate | 2006 |
| record_format | dspace |
| spelling | mit-1721.1/312212019-04-12T08:37:54Z Amorphous Infrastructure for Language Implementation Newton, Ryan Beal, Jacob Gerald Sussman Mathematics and Computation 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. 2006-03-01T19:47:25Z 2006-03-01T19:47:25Z 2002-12-10 MIT-CSAIL-TR-2006-015 http://hdl.handle.net/1721.1/31221 6.978 Final Project en_US Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory 20 p. 21433070 bytes 757210 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Newton, Ryan Beal, Jacob Amorphous Infrastructure for Language Implementation |
| title | Amorphous Infrastructure for Language Implementation |
| title_full | Amorphous Infrastructure for Language Implementation |
| title_fullStr | Amorphous Infrastructure for Language Implementation |
| title_full_unstemmed | Amorphous Infrastructure for Language Implementation |
| title_short | Amorphous Infrastructure for Language Implementation |
| title_sort | amorphous infrastructure for language implementation |
| url | http://hdl.handle.net/1721.1/31221 |
| work_keys_str_mv | AT newtonryan amorphousinfrastructureforlanguageimplementation AT bealjacob amorphousinfrastructureforlanguageimplementation |