There is no generally accepted foundation for typed concurrent programming, and even a canonical untyped calculus has been slow to emerge.
Examples are deadlock-freedom, liveness and termination.
Abramsky's recent work on interaction categories has established a semantic foundation for typed concurrency with the capability of constructing types which specify complex properties. We use these ideas as the basis for a typed calculus of synchronous processes. We exhibit tight connections between typed terms, classical linear logic and categorical semantics similar to the familiar Curry-Howard isomorphism and Categorical Logic correspondence in functional computation. The syntax of our calculus is inspired by those of existing process calculi, especially SCCS, and also by linear realisability algebras. The calculus has an operational semantics in the usual style, which yields a notion of typed bisimulation.