Behavioral Equivalence in the Polymorphic Pi-Calculus

Behavioral Equivalence in the Polymorphic Pi-Calculus (1997)

by Benjamin C. Pierce , Davide Sangiorgi

Venue:	JOURNAL OF THE ACM
Citations:	51 - 6 self

User correction supplied by mph

Datum	Value	Source
TITLE	Behavioral Equivalence in the Polymorphic Pi-Calculus	user correction - Legacy Corrections
AUTHOR NAME	Benjamin C. Pierce	user correction
AUTHOR AFFIL	Computer Science Department; Indiana University	user correction
AUTHOR ADDR	Lindley Hall 215; Bloomington, IN 47405, USA	user correction
AUTHOR NAME	Davide Sangiorgi	user correction
AUTHOR AFFIL	INRIA-Sophia Antipolis	user correction
AUTHOR ADDR	2004 Rue des Lucioles; B.P. 93; 06902 Sophia Antipolis, France	user correction
ABSTRACT	We investigate parametric polymorphism in message-based concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacalculus 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.	user correction
YEAR	1997	user correction - Legacy Corrections
VENUE	JOURNAL OF THE ACM	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	2000	INFERENCE
VOLUME	47	INFERENCE
CITATIONS	3 found	ParsCit 1.0