Fully abstract models of programming languages
Fully abstract models of programming languages
A calculus of mobile processes, II
Information and Computation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Behavioral equivalence in the polymorphic pi-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A typed language for distributed mobile processes (extended abstract)
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the expressiveness of internal mobility in name-passing calculi
Theoretical Computer Science
A calculus for cryptographic protocols
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Lazy functions and mobile processes
Proof, language, and interaction
Type reconstruction for linear &pgr;-calculus with I/O subtyping
Information and Computation
Information and Computation
A uniform type structure for secure information flow
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource access control in systems of mobile agents
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Information flow vs. resource access in the asynchronous pi-calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computation
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The Name Discipline of Uniform Receptiveness (Extended Abstract)
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Global/Local Subtyping and Capability Inference for a Distributed pi-calculus
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Asynchrony in Name-Passing Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
A fully abstract model for the π-calculus
Information and Computation
A Fully Abstract Domain Model for the p-Calculus
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
A generic type system for the Pi-calculus
Theoretical Computer Science
Comparing communication primitives via their relative expressive power
Information and Computation
A Translation of Beta-binders in a Prioritized Pi-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
A type system for terms of the monadic π-calculus is introduced and used to obtain a full-abstraction result for the translation of the polyadic π-calculus into the monadic calculus: well-sorted terms of the polyadic calculus are barbed congruent iff their translations are typed barbed congruent.