A polymorphic type system with progress for binary sessions

Authors:
Zhenguo Yang;Farong Zhong;Jinfang Zhang
Affiliations:
Department of Computer Science, Zhejiang Normal University, Jinhua, Zhejiang Province, P.R. China;Department of Computer Science, Zhejiang Normal University, Jinhua, Zhejiang Province, P.R. China;Department of Computer Science, Zhejiang Normal University, Jinhua, Zhejiang Province, P.R. China
Venue:
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
Year:
2012

Citing 17
Cited 1

A sort inference algorithm for the polyadic &pgr;-calculus

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus of mobile processes, I

Information and Computation
Behavioral equivalence in the polymorphic pi-calculus

Journal of the ACM (JACM)
Language Primitives and Type Discipline for Structured Communication-Based Programming

ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
An Interaction-based Language and its Typing System

PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Types for Dynamic Interaction

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Principal Typing Schemes in a Polyadic pi-Calculus

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Polymorphic Type System for the Polyadic pi-calculus

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Towards a theory of type structure

Programming Symposium, Proceedings Colloque sur la Programmation
Types and Subtypes for Client-Server Interactions

ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Subtyping for session types in the pi calculus

Acta Informatica
Language Primitives and Type Discipline for Structured Communication-Based Programming Revisited: Two Systems for Higher-Order Session Communication

Electronic Notes in Theoretical Computer Science (ENTCS)
Multiparty asynchronous session types

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Type System for Client Progress in a Service-Oriented Calculus

Concurrency, Graphs and Models
Asynchronous session types and progress for object oriented languages

FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
On progress for structured communications

TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Session types for object-oriented languages

ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming

On action permutation and progress for partially commutative asynchronous binary sessions

IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A static bounded polymorphic type system is presented in this paper, which ensures the progress property, i.e., the property that once a communication has been established, well-formed programs will never starve at communication points. The introduction of subtyping for session types and the relaxed duality relation increases the flexibility of the type system, and allows the participants in a conversation to follow different protocols that are nevertheless compatible in a sense defined by the subtyping relation. In addition, to keep progress in sessions, the type compliance is defined to associate with the relaxed duality relation, where the environment is balanced. Finally, the soundness and communication safety of the type system are proved, and some related work and possible future work in this area are discussed.