Result: Subtyping for session types in the pi calculus

Title:
Subtyping for session types in the pi calculus
Authors:
GAY, Simon, HOLE, Malcolm
Source:
Types in concurrency (Part I)Acta informatica. 42(2-3):191-225
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 35 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Théorie programmation, Programming theory, Logiciel, Software, Langages de programmation, Programming languages, Algorithme, Algorithm, Algoritmo, Informatique théorique, Computer theory, Informática teórica, Langage programmation, Programming language, Lenguaje programación, Protocole, Protocols, Spécification, Specification, Especificación, Sémantique opérationnelle, Operational semantics, Semantica operacional, Typage, Typing, Tipificación, pi calcul, pi calculus, pi calculo, Calcul pi, Programmation concurrente, Sous typage, Système types
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Department of Computing Science, University of Glasgow, G12 8QQ, United Kingdom
Dpartment of Computer Science, Royal Holloway, University of London, United Kingdom
ISSN:
0001-5903
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17303208
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17303208
Database:
PASCAL Archive

Further Information

Extending the pi calculus with the session types proposed by Honda et al. allows high-level specifications of structured patterns of communication, such as client-server protocols, to be expressed as types and verified by static typechecking. We define a notion of subtyping for session types, which allows protocol specifications to be extended in order to describe richer behaviour; for example, an implemented server can be refined without invalidating type-correctness of an overall system. We formalize the syntax, operational semantics and typing rules of an extended pi calculus, prove that typability guarantees absence of run-time communication errors, and show that the typing rules can be transformed into a practical typechecking algorithm.