Show simple item record

dc.contributor.advisorGerald Jay Sussman
dc.contributor.authorSussman, Gerald Jayen_US
dc.contributor.authorRadul, Alexeyen_US
dc.contributor.otherMathematics and Computationen_US
dc.date.accessioned2009-01-27T06:15:12Z
dc.date.available2009-01-27T06:15:12Z
dc.date.issued2009-01-26
dc.identifier.urihttp://hdl.handle.net/1721.1/44215
dc.description.abstractWe 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.en_US
dc.format.extent50 p.en_US
dc.relation.ispartofseriesMIT-CSAIL-TR-2009-002
dc.rightsCreative Commons Attribution-Share Alike 3.0 Unporteden_US
dc.rights.urihttp://creativecommons.org/licenses/by-sa/3.0/
dc.subjectConstraint-based programmingen_US
dc.subjectProgramming modelsen_US
dc.subjectDistributed searchen_US
dc.titleThe Art of the Propagatoren_US


Files in this item

Thumbnail
Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record