Full abstraction for Polymorphic Pi-Calculus

Jeffrey, Alan and Rathke, Julian (2005) Full abstraction for Polymorphic Pi-Calculus. In: Proceedings FOSSACS, part of ETAPS. Lecture Notes in Computer Science, Edinburgh.

Full text not available from this repository.

Abstract

The problem of finding a fully abstract model for the polymorphic π-
calculus was stated in Pierce and Sangiorgi’s work in 1997 and has remained open
since then. In this paper, we show that a variant of their language has a fully abstract model, which does not depend on type unification or logical relations. This
is the first fully abstract model for a polymorphic concurrent language. In addition, we discuss the relationship between our work and Pierce and Sangiorgi’s,
and show that their model based on type unification is sound but not complete.

Item Type: Conference or Workshop Item (Paper)
Schools and Departments: School of Engineering and Informatics > Informatics
Depositing User: EPrints Services
Date Deposited: 06 Feb 2012 20:31
Last Modified: 12 Apr 2012 10:29
URI: http://sro.sussex.ac.uk/id/eprint/26373
📧 Request an update