Behavioral equivalence in the polymorphic pi-calculus
DOI10.1145/337244.337261zbMATH Open1094.68591OpenAlexW2011491369MaRDI QIDQ5487879FDOQ5487879
Authors: Benjamin C. Pierce, Davide Sangiorgi 
Publication date: 12 September 2006
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cis_reports/95
Recommendations
- Genericity and the \(\pi\)-calculus
- Behavioral polymorphism and parametricity in session-based communication
- Typed behavioural equivalences for processes in the presence of subtyping
- scientific article; zbMATH DE number 1956508
- Typed behavioural equivalences for processes in the presence of subtyping
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (28)
- An exact correspondence between a typed pi-calculus and polarised proof-nets
- Bisimulation and coinduction enhancements: a historical perspective
- Genericity and the \(\pi\)-calculus
- Typed behavioural equivalences for processes in the presence of subtyping
- safeDpi: a language for controlling mobile code
- Propositions as sessions
- Encoding distributed areas and local communication into the \(\pi \)-calculus
- On hierarchical communication topologies in the \(\pi\)-calculus
- Full abstraction for polymorphic \(\pi \)-calculus
- Behavioural equivalences for dynamic web data
- Assigning types to processes
- A generic type system for the pi-calculus
- Types and full abstraction for polyadic \(\pi\)-calculus
- Security types for dynamic web data
- The name discipline of uniform receptiveness
- Extending modal transition systems with structured labels
- Linear logical relations and observational equivalences for session-based concurrency
- The security pi-calculus and non-interference
- Types for ambient and process mobility
- Typed behavioural equivalences for processes in the presence of subtyping
- The name discipline of uniform receptiveness (extended abstract)
- Behavioral polymorphism and parametricity in session-based communication
- On confluence in the \(\pi\)-calculus
- A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
- Bounded polymorphism in session types
- A type system for lock-free processes
- Subtyping for session types in the pi calculus
- A well-behaved LTS for the pi-calculus (abstract)
Uses Software
This page was built for publication: Behavioral equivalence in the polymorphic pi-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487879)
