by Tony Garnock-Jones
PhD dissertation, supervised by Matthias Felleisen
Northeastern University, December 2017
The dissertation itself is available in two formats:
On this page, you will find a recording of my dissertation defense talk, the slides I used for my talk, a source code snapshot of the Syndicate implementations and examples, and the proof scripts accompanying the dissertation.
Concurrent computations resemble conversations. In a conversation, participants direct utterances at others and, as the conversation evolves, exploit the known common context to advance the conversation. Similarly, collaborating software components share knowledge with each other in order to make progress as a group towards a common goal.
This dissertation studies concurrency from the perspective of cooperative knowledge-sharing, taking the conversational exchange of knowledge as a central concern in the design of concurrent programming languages. In doing so, it makes five contributions:
It develops the idea of a common dataspace as a medium for knowledge exchange among concurrent components, enabling a new approach to concurrent programming.
While dataspaces loosely resemble both “fact spaces” from the world of Linda-style languages and Erlang’s collaborative model, they significantly differ in many details.
It offers the first crisp formulation of cooperative, conversational knowledge-exchange as a mathematical model.
It describes two faithful implementations of the model for two quite different languages.
It proposes a completely novel suite of linguistic constructs for organizing the internal structure of individual actors in a conversational setting.
The combination of dataspaces with these constructs is dubbed Syndicate.
It presents and analyzes evidence suggesting that the proposed techniques and constructs combine to simplify concurrent programming.
The dataspace concept stands alone in its focus on representation and manipulation of conversational frames and conversational state and in its integral use of explicit epistemic knowledge. The design is particularly suited to integration of general-purpose I/O with otherwise-functional languages, but also applies to actor-like settings more generally.
Dissertation defense talk recording
I defended my thesis on the 8th of December, 2017. The talk was recorded. There is a copy on the Internet Archive (embedded below) and another at YouTube. (I’m afraid that the sound is very quiet on the recording.)
Dissertation defense slides
The slides from my defense talk are available
here (also embedded below). Use the
p keys to move to the next and previous slide, respectively.
Source code snapshot
This zip file contains source code for the Syndicate prototypes and example applications, as they were at the time of my dissertation:
Please see also the downloads available at syndicate-lang.org and on Github.
The Coq scripts representing the proofs of some of the theorems from my dissertation will be available here shortly.