Type checking a multithreaded functional language with session types

We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static type checking. A session type, associated with a communication channel, specifies the state transitions of a protocol and also the data types of messages asso...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 368; číslo 1; s. 64 - 87
Hlavní autoři: Vasconcelos, Vasco T., Gay, Simon J., Ravara, António
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 05.12.2006
Elsevier
Témata:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Concurrent programming
Exact sciences and technology
Programming theory
Session types
Specification of communication protocols
Static type checking
Theoretical computing
Specification of communication protocols
Static type checking
Session types
Concurrent programming
Functional language
Data type
Computer theory
Semantics
Transmission protocol
Specification
Safety
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static type checking. A session type, associated with a communication channel, specifies the state transitions of a protocol and also the data types of messages associated with transitions; thus type checking can verify both correctness of individual messages and correctness of sequences of transitions. Previously, session types have mainly been studied in the context of the π -calculus; instead, our formulation is based on a multithreaded functional language with side-effecting input/output operations. Our typing judgements statically describe dynamic changes in the types of channels, and our function types not only specify argument and result types but also describe changes in channels. We formalize the syntax, semantics and type checking system of our language, and prove subject reduction and runtime type safety theorems.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2006.06.028