Full abstraction for polymorphic π-calculus
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 logic...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2008-01-28.
|
| Subjects: | |
| Online Access: | Get fulltext |