On sequentiality and well-bracketing in the π-calculus
The π-calculus is used as a model for programming languages. Its contexts exhibit arbitrary concurrency, making them very discriminating. This may prevent validating desirable behavioural equivalences in cases when more disciplined contexts are expected.In this paper we focus on two such common disc...
Saved in:
| Published in: | Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
29.06.2021
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!