Full Abstraction for Polymorphic Pi-Calculus

traction for Polymorphic Pi-Calculus Alan Jeffrey 1,2 and Julian Rathke3 1 Bell Labs, Lucent Technologies, Chicago, IL, USA 2 DePaul University, Chicago, IL, USA 3 University of Sussex, Brighton, UK 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 slight variant of their language has a direct fully abstract model, which does not depend on type unification or logations. This is the first fully abstract model for a polymorphic concurrent language. In addition, we discuss the relationship between our work and Pierce iorgi’s, and show that their conjectured fully abstract model is, in fact, sound but not complete.

• Type: Conference
• Year: 2005
• Where: FOSSACS
• Authors: Alan Jeffrey, Julian Rathke
• Keywords: Abstract Model, Applied Computing, FOSSACS 2005, Polymorphic Concurrent Language, Polymorphic Pi-Calculus Alan