Type checking a multithreaded functional language with session types

Vasconcelos, Vasco T.; Ravara, António

doi:10.1016/j.tcs.2006.06.028

Cited by 75 publications

(60 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to guarantee protocol soundness it is crucial to introduce a duality relation between shared session types which ensures that two sessions agree with each other with respect to the order in which data are communicated and with respect to the types of the communicated data. The introduction of bounded polymorphism allows to relate more than one session type to another session type, in contrast to the systems of [1,12,16,20,30], where each session type has a unique dual. The definition of this relation (denoted by ) is given in Fig.…”

Section: Typesmentioning

confidence: 99%

Bounded Session Types for Object Oriented Languages

Dezani‐Ciancaglini

Giachino

Drossopoulou

et al. 2007

Formal Methods for Components and Objects

View full text Add to dashboard Cite

Abstract. Earlier work explored the introduction of session types into object oriented languages. Following the session types literature, two parties would start communicating, provided the types attached to that communication, i.e. the corresponding session types, were dual of each other. Then, the type system was able to ensure soundness, in the sense that two communicating partners were guaranteed to receive/send sequences of values following the order specified by their session types. In the current paper we improve upon our earlier work in two ways: we extend the type system to support bounded polymorphism, and we make the selection more object-oriented, so that control structures determine how to continue evaluation, depending on the class of the object being sent/received. Interestingly, although our notion of selection is more powerful than that in earlier work, the ensuing system turned out not to be more complex, except for the notion of duality, which needed to be extended, to correctly deal with bounded polymorphism, and to capture the new notion of selection. The paper contains an example, informal explanations, a formal description of the operational semantics and of type system, and a proof of subject reduction.

show abstract

Section: Typesmentioning

confidence: 99%

Bounded Session Types for Object Oriented Languages

Dezani‐Ciancaglini

Giachino

Drossopoulou

et al. 2007

Formal Methods for Components and Objects

View full text Add to dashboard Cite

show abstract

“…As mentioned in the introduction, work on session types for functional languages started with our own work (Gay et al 2003;Vasconcelos et al 2004Vasconcelos et al , 2006. Neubauer and Thiemann (2004a) showed how to implement session types on top of the Haskell programming language; furthermore, Neubauer and Thiemann (2004b) modelled software components as concurrent functional processes and used session types to extract the smallest protocol required by each process; in addition, they addressed the problem of program transformation, from sequential to multi-tier, guided by session types (Neubauer and Thiemann 2005).…”

Section: Related and Future Workmentioning

confidence: 99%

“…Much of the research has defined systems of session types for pi calculus and related process calculi, but recently there has been considerable interest in session types for more standard language paradigms. Our own previous work (Gay et al 2003;Vasconcelos et al 2004Vasconcelos et al , 2006 was the first proposal for a functional language with session types. Neubauer and Thiemann (2004a) took a different approach, embedding session types within the type system of Haskell.…”

Section: Introductionmentioning

confidence: 99%

Linear type theory for asynchronous session types

Gay¹,

Vasconcelos²

2009

J. Funct. Prog.

Self Cite

160

203

View full text Add to dashboard Cite

Session types support a type-theoretic formulation of structured patterns of communication, so that the communication behaviour of agents in a distributed system can be verified by static typechecking. Applications include network protocols, business processes and operating system services. In this paper we define a multithreaded functional language with session types, which unifies, simplifies and extends previous work. There are four main contributions. First is an operational semantics with buffered channels, instead of the synchronous communication of previous work. Second, we prove that the session type of a channel gives an upper bound on the necessary size of the buffer. Third, session types are manipulated by means of the standard structures of a linear type theory, rather than by means of new forms of typing judgement. Fourth, a notion of subtyping, including the standard subtyping relation for session types (imported into the functional setting), and a novel form of subtyping between standard and linear function types, which allows the typechecker to handle linear types conveniently. Our new approach significantly simplifies session types in the functional setting, clarifies their essential features and provides a secure foundation for language developments such as polymorphism and object-orientation.

show abstract

“…They were firstly introduced for a dialect of the pi calculus (Honda et al, 1998;Takeuchi et al, 1994). Later the concept has been transferred to different realms, including functional Vasconcelos et al, 2006) and object-oriented programming (Capecchi et al, 2009;Coppo et al, 2007;Dezani-Ciancaglini et al, 2005;Dezani-Ciancaglini et al, 2007;Dezani-Ciancaglini et al, 2006;Hu et al, 2008), service oriented computing (Cruz-Filipe et al, 2008;Bruni and Mezzina, 2008) and operating systems (Fähndrich et al, 2006), to name a few; the reader is referred to (Dezani-Ciancaglini and de'Liguoro, 2010) for a recent overview.…”

Section: Introductionmentioning

confidence: 99%

Linearity, session types and the Pi calculus

Giunti¹,

Vasconcelos²

2014

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

We present a type system based on session types that works on a conventional pi calculus. Types are equipped with a constructor that describes the two ends of a single communication channel, this being the only type available for describing the behaviour of channels. Session types, in turn, describe the behaviour of each individual channel end, as usual. A novel notion of typing context split allows for typing processes not typable with extant type systems. We show that our system guarantees that typed processes do not engage in races for linear resources. We assess the expressiveness of type system by providing three distinct encodings-from the pi calculus with polarised variables, from the pi calculus with accept and request primitives, and from the linear pi calculus-into our system. For each language we present operational and typing correspondences, showing that our system effectively subsumes foregoing works on linear and session types. In the case of the linear pi calculus we also provide a completeness result.

show abstract

Type checking a multithreaded functional language with session types

Cited by 75 publications

References 27 publications

Bounded Session Types for Object Oriented Languages

Bounded Session Types for Object Oriented Languages

Linear type theory for asynchronous session types

Linearity, session types and the Pi calculus

Contact Info

Product

Resources

About