Communication and concurrency
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
Behavioral equivalence in the polymorphic pi-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Changeable interfaces and promised messages for concurrent components
Proceedings of the 1999 ACM symposium on Applied computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
A generic type system for the Pi-calculus
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Flexible types for a concurrent model
Concurrent object-oriented programming and petri nets
Behavioural typing for objects and process calculi
Formal methods for distributed processing
Nordic Journal of Computing
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
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
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
Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Types and Subtypes for Client-Server Interactions
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
A generic type system for the Pi-calculus
Theoretical Computer Science
Information and Computation
Types for Active Objects with Static Deadlock Prevention
Fundamenta Informaticae
Typechecking Safe Process Synchronization
Electronic Notes in Theoretical Computer Science (ENTCS)
Sequence Types for the π-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
On the complexity of termination inference for processes
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
State inference for dynamically changing interfaces
Computer Languages
Types for Active Objects with Static Deadlock Prevention
Fundamenta Informaticae
A polymorphic type system with progress for binary sessions
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
| Hi-index | 0.00 |
In Milner's polyadic &pgr;-calculus there is a notion of sorts which is analogous to the notion of types in functional programming. As a well-typed program applies functions to arguments in a consistent way, a well-sorted process uses communication channels in a consistent way. An open problem is whether there is an algorithm to infer sorts in the &pgr;-calculus in the same way that types can be inferred in functional programming. Here we solve the problem by presenting an algorithm which infers the most general sorting for a process in the first-order calculus, and proving its correctness. The algorithm is similar in style to those used for Hindley-Milner type inference in functional languages.