ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Mobile Processes: A Commented Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Generating Type Systems for Process Graphs
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Typing Non-uniform Concurrent Objects
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A pi-calculus Process Semantics of Concurrent Idealised ALGOL
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Reasoning About Concurrent Systems Using Types
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Types and Subtypes for Client-Server Interactions
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Mobile processes: a commented bibliography
Modeling and verification of parallel processes
Typed behavioural equivalences for processes in the presence of subtyping
Mathematical Structures in Computer Science
Types and full abstraction for polyadic π-calculus
Information and Computation
Types and full abstraction for polyadic π-calculus
Information and Computation
| Hi-index | 0.00 |
We propose a novel static type system for a process calculus, which ensures both partial deadlock-freedom and partial confluence. The key novel ideas are (1) introduction of the order of channel use as type information, and (2) classification of communication channels into reliable and unreliable channels based on their usage and a guarantee of the usage by the type system. We can ensure that communication on reliable channels never causes deadlock and also that certain reliable channels never introduce nondeterminism. With the type system, for example, the simply typed lambda-calculus can be encoded into the deadlock-free and confluent fragment of our process calculus; we can therefore recover behavior of the typed lambda-calculus in the level of process calculi. We also show that typical concurrent objects can also be encoded into the deadlock-free fragment.