| dc.date.accessioned | 2008-04-10T16:18:47Z | |
| dc.date.accessioned | 2018-11-24T10:27:28Z | |
| dc.date.available | 2008-04-10T16:18:47Z | |
| dc.date.available | 2018-11-24T10:27:28Z | |
| dc.date.issued | 1979-02 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/41146 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/41146 | |
| dc.description | This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the laboratory's artificial intelligence research is provided in part by the Office of Naval Research of the Department of Defense under contract N00014-75-C-0522. | en |
| dc.description.abstract | Contemporary concurrent programming languages fall roughly into two classes. Languages in the first class support the notion of a sequence of values and some kind of pipelining operation over the sequence of values. Languages in the second class support the notion of transactions and some way to serialize transactions. In terms of the actor model of computation this distinction corresponds to the difference between serialized and unserialized actors. In this paper the utility of modeling both serialized and unserialized actors in a coherent formalism is demonstrated. | en |
| dc.language.iso | en_US | en |
| dc.publisher | MIT Artificial Intelligence Laboratory | en |
| dc.title | Concurrent Systems Need Both Sequences And Serializers | en |
| dc.type | Working Paper | en |
