[Alta-Logic] Friday talk: logic for concurrent programs

[Robin Cockett]

Time: Friday  8th August, 3:00pm

Speaker: Aurore Alcolei

Title: A compact logic for concurrent program

Abstract:

> Cockett and Pastro provided, in previous work, a term logic, a proof
> theory, and a categorical semantic for concurrency. The proof theory was
> essentially linear logic with the addition of message passing primitives
> and the categorical semantics was that of a linear actegory. The term logic
> associated to the proof theory can be viewed as a minimalist programming
> language for message-passing. This language has the good property of
> producing programs that always terminate without deadlock. However, the
> proposed setting does not match the predominate view of the semantics of
> concurrency or distributed  systems, since it does not allowed for multiple
> interconnections between processes and it is completely deterministic.
>


> In this talk we investigate a compact version of Cockett and Pastro's
> setting, in which the "tensor" and the "par" operators of the linear
> actegory are made equal. We will show how this allows for the full range of
> connection topologies and how this necessarily introduces non-determinism
> in the setting.
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.ucalgary.ca/pipermail/alta-logic-l/attachments/20140805/8c8379a6/attachment.html