Behavioral equivalence in the polymorphic pi-calculus
- 1 May 2000
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 47 (3) , 531-584
- https://doi.org/10.1145/337244.337261
Abstract
We investigateparametric polymorphismin message-based concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambda-calculus of Girard and Reynolds.Polymorphism constrains the power of observers by preventing them from directly manipulating data values whose types are abstract, leading to notions of equivalence much coarser than the standard untyped ones. We study the nature of these constraints through simple examples of concurrent abstract data types and develop basic theoretical machinery for establishing bisimilarity of polymorphic processes.We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic pi-calculus and ML.Keywords
This publication has 16 references indexed in Scilit:
- An Interpretation of Typed Objects into Typedπ-CalculusInformation and Computation, 1998
- A partially deadlock-free typed process calculusACM Transactions on Programming Languages and Systems, 1998
- π-Calculus, internal mobility, and agent-passing calculiTheoretical Computer Science, 1996
- On reduction-based process semanticsTheoretical Computer Science, 1995
- Unification under a mixed prefixJournal of Symbolic Computation, 1992
- A calculus of mobile processes, IIInformation and Computation, 1992
- Functions as processesMathematical Structures in Computer Science, 1992
- Abstract types have existential typeACM Transactions on Programming Languages and Systems, 1988
- A context dependent equivalence between processesTheoretical Computer Science, 1987
- Testing equivalences for processesTheoretical Computer Science, 1984