Summary: Specification Structures and Propositions­as­Types for
Concurrency \Lambda
Samson Abramsky Simon Gay Rajagopal Nagarajan
Department of Computing,
Imperial College of Science, Technology and Medicine, London, UK.
email: fsa,sjg3,rn4g@doc.ic.ac.uk.
Abstract
Many different notions of ``property of interest'' and methods of verifying such
properties arise naturally in programming. A general framework of ``Specification
Structures'' is presented for combining different notions and methods in a coherent
fashion. This is then applied to concurrency in the setting of Interaction Categories.
As an example, we present a type system for concurrent processes strong enough to
guarantee deadlock­freedom, and expressive enough to allow the treatment of some
standard examples from the literature. This is illustrated using the classic Dining
Philosophers problem.
This paper appears in Logics for Concurrency: Structure vs. Automata---Proceedings of the
VIIIth Banff Higher Order Workshop (F. Moller and G. Birtwistle, eds), Springer­Verlag
Lecture Notes in Computer Science, 1995.
1 Introduction
Type Inference and Verification are two main paradigms for constraining the behaviour

Source: Abramsky, Samson - Computing Laboratory, University of Oxford

Collections: Computer Technologies and Information Sciences