Towards fully abstract semantics for local variables
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An efficiency preorder for processes
Acta Informatica
A calculus of mobile processes, I
Information and Computation
Information and Computation
Parametricity and local variables
Journal of the ACM (JACM)
Proving congruence of bisimulation in functional programming languages
Information and Computation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ALGOL-like languages (v.2)
Communication and Concurrency
On the Proof Method for Bisimulation (Extended Abstract)
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A pi-Calculus Semantics for an Object-Based Design Notation
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Imperative objects and mobile processes
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Reasoning about local variables with operationally-based logical relations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Partially Deadlock-free Typed Process Calculus
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Bisimulation in Name-Passing Calculi without Matching
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A Broadcast-based Calculus for Communicating Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Process-Algebraic Foundations of Aspect-Oriented Programming
REFLECTION '01 Proceedings of the Third International Conference on Metalevel Architectures and Separation of Crosscutting Concerns
Full Abstraction Without Synchronization Primitives
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We study the use of the π-calculus for semantical descriptions of languages such as Concurrent Idealised ALGOL (CIA), combining imperative, functional and concurrent features. We first present an operational semantics for CIA, given by SOS rules and a contextual form of behavioural equivalence; then a π-calculus semantics. As behavioural equivalence on π-calculus processes we choose the standard (weak early) bisimilarity. We compare the two semantics, demonstrating that there is a close operational correspondence between them and that the π-calculus semantics is sound. This allows for applying the π-calculus theory in proving behavioural properties of CIA phrases. We discuss laws and examples which have served as benchmarks to various semantics, and a more complex example involving procedures of higher order.