The Art of the Propagator
We develop a programming model built on the idea that the basic computational elements are autonomous machines interconnected by shared cells through which they communicate. Each machine continuously examines the cells it is interested in, and adds information to some based on deductions it can make...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/44215 |
| _version_ | 1811073299056164864 |
|---|---|
| author | Sussman, Gerald Jay Radul, Alexey |
| author2 | Gerald Jay Sussman |
| author_facet | Gerald Jay Sussman Sussman, Gerald Jay Radul, Alexey |
| author_sort | Sussman, Gerald Jay |
| collection | MIT |
| description | We develop a programming model built on the idea that the basic computational elements are autonomous machines interconnected by shared cells through which they communicate. Each machine continuously examines the cells it is interested in, and adds information to some based on deductions it can make from information from the others. This model makes it easy to smoothly combine expression-oriented and constraint-based programming; it also easily accommodates implicit incremental distributed search in ordinary programs. This work builds on the original research of Guy Lewis Steele Jr. and was developed more recently with the help of Chris Hanson. |
| first_indexed | 2024-09-23T09:30:56Z |
| id | mit-1721.1/44215 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T09:30:56Z |
| publishDate | 2009 |
| record_format | dspace |
| spelling | mit-1721.1/442152019-04-11T00:32:21Z The Art of the Propagator Sussman, Gerald Jay Radul, Alexey Gerald Jay Sussman Mathematics and Computation Constraint-based programming Programming models Distributed search We develop a programming model built on the idea that the basic computational elements are autonomous machines interconnected by shared cells through which they communicate. Each machine continuously examines the cells it is interested in, and adds information to some based on deductions it can make from information from the others. This model makes it easy to smoothly combine expression-oriented and constraint-based programming; it also easily accommodates implicit incremental distributed search in ordinary programs. This work builds on the original research of Guy Lewis Steele Jr. and was developed more recently with the help of Chris Hanson. 2009-01-27T06:15:12Z 2009-01-27T06:15:12Z 2009-01-26 http://hdl.handle.net/1721.1/44215 MIT-CSAIL-TR-2009-002 Creative Commons Attribution-Share Alike 3.0 Unported http://creativecommons.org/licenses/by-sa/3.0/ 50 p. application/pdf application/postscript application/octet-stream |
| spellingShingle | Constraint-based programming Programming models Distributed search Sussman, Gerald Jay Radul, Alexey The Art of the Propagator |
| title | The Art of the Propagator |
| title_full | The Art of the Propagator |
| title_fullStr | The Art of the Propagator |
| title_full_unstemmed | The Art of the Propagator |
| title_short | The Art of the Propagator |
| title_sort | art of the propagator |
| topic | Constraint-based programming Programming models Distributed search |
| url | http://hdl.handle.net/1721.1/44215 |
| work_keys_str_mv | AT sussmangeraldjay theartofthepropagator AT radulalexey theartofthepropagator AT sussmangeraldjay artofthepropagator AT radulalexey artofthepropagator |