High-level Concurrent Languages

ing Communications in Mobile Processes Vasco T. Vasconcelos, University of Lisbon Witnessing the increase of complexity on the objects that names may carry in process algebras — from CCS, through the (monadic and then the polyadic) picalculus, to the calculus of objects (where names carry a label together with a tuple of names) — we propose a framework where communications are taken from an abstract universe. The calculus, parametric on what processes may exchange, is based on the asynchronous pi-calculus, the novelty being the usage of “located guarded-processes” as receptors. Such a process fires the body of a guard that matches the incoming message. Types emerge from the actual syntax of communications by means of a choice and a “carries” constructor. A type assignment system ensures that well-typed programs will not go wrong. Largely lambda, with a slice of pi Philip Wadler, Bell Labs, Lucent Technologies Lambda calculus remains a source of inspiration for work on concurrent calculi, and so the first part of the talk summarised some recent developments in lambda calculus. The second part of the talk reversed the usual idea of embedding lambda calculus within pi calculus, and compared two sets of primitives for embedding pi calculus within lambda calculus.