The University of Southampton
University of Southampton Institutional Repository

Full abstraction for polymorphic ?-calculus

Rathke, Julian and Jeffrey, Alan (2008) Full abstraction for polymorphic ?-calculus Theoretical Computer Science, 390, (2-3), pp. 171-196. (doi:10.1016/j.tcs.2007.09.020).

Record type: Article


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.

PDF fullabspolypiTCS.pdf - Version of Record
Restricted to Repository staff only
Download (500kB)

More information

Published date: 28 January 2008
Organisations: Electronic & Software Systems


Local EPrints ID: 351165
ISSN: 0304-3975
PURE UUID: a8c82767-7810-451b-a614-1208d85773ef

Catalogue record

Date deposited: 17 Apr 2013 12:04
Last modified: 18 Jul 2017 04:28

Export record



Author: Julian Rathke
Author: Alan Jeffrey

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.