On the preciseness of subtyping in session types

Subtyping in concurrency has been extensively studied since early 1990s as one of the most interesting issues in type theory. The correctness of subtyping relations has been usually provided as the soundness for type safety. The converse direction, the completeness, has been largely ignored in spite of its usefulness to define the greatest subtyping relation ensuring type safety. This paper formalises preciseness (i.e. both soundness and completeness) of subtyping for mobile processes and studies it for the synchronous and the asynchronous session calculi. We first prove that the well-known session subtyping, the branching-selection subtyping, is sound and complete for the synchronous calculus. Next we show that in the asynchronous calculus, this subtyping is incomplete for type-safety: that is, there exist session types T and S such that T can safely be considered as a subtype of S, but T ≤ S is not derivable by the subtyping. We then propose an asynchronous sub-typing system which is sound and complete for the asynchronous calculus. The method gives a general guidance to design rigorous channel-based subtypings respecting desired safety properties

Linearity in the non-deterministic call-by-value setting

We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity present in such formalisms. After proving the subject reduction and the strong normalisation properties, we propose a translation of this calculus into the System F with pairs, which corresponds to a non linear fragment of linear logic. The translation provides a deeper understanding of the linearity in our setting.Comment: 15 pages. To appear in WoLLIC 201

A Fully Abstract Model for Mobile Ambients

AbstractAim of this paper is to investigate the possibility of developing filter models for calculi representing mobility. We will define a model for a variant of the Ambient Calculus. This model turns out to be fully abstract with respect to a notion of contextual equivalence which takes into account the ambients at top level

Precise subtyping for synchronous multiparty sessions

The notion of subtyping has gained an important role both in theoretical and applicative domains: in lambda and concurrent calculi as well as in programming languages. The soundness and the completeness, together referred to as the preciseness of subtyping, can be considered from two different points of view: operational and denotational. The former preciseness has been recently developed with respect to type safety, i.e. the safe replacement of a term of a smaller type when a term of a bigger type is expected. The latter preciseness is based on the denotation of a type which is a mathematical object that describes the meaning of the type in accordance with the denotations of other expressions from the language. The result of this paper is the operational and denotational preciseness of the subtyping for a synchronous multiparty session calculus. The novelty of this paper is the introduction of characteristic global types to prove the operational completeness

Call-by-value non-determinism in a linear logic type discipline

We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent intersection types, we endow this calculus with a type system based on the so-called Girard's second translation of intuitionistic logic into linear logic. We prove that a term is typable if and only if it is converging, and that its typing tree carries enough information to give a bound on the length of its lazy call-by-value reduction. Moreover, when the typing tree is minimal, such a bound becomes the exact length of the reduction

Stability of Glutamate-Aspartate Cardioplegia Additive Solution in Polyolefin IV Bags

Objective: Glutamate-aspartate cardioplegia additive solution (GACAS) is used to enhance myocardial preservation and left ventricular function during some cardiac surgeries. This study was designed to evaluate the stability of compounded GACAS stored in sterile polyolefin intravenous (IV) bags. The goal is to extend the default USP beyond-use date (BUD) and reduce unnecessary inventory waste. Methods: GACAS was compounded and packaged in sterile polyolefin 250 mL IV bags. The concentration was 232 mM for each amino acid. The samples were stored under refrigeration (2°C-8°C) and analyzed at 0, 1, and 2 months. At each time point, the samples were evaluated by pH measurement and visual inspection for color, clarity, and particulates. The samples were also analyzed by high-performance liquid chromatography (HPLC) for potency and degradation products. Due to the lack of ultraviolet (UV) chromophores of glutamate and aspartate, the samples were derivatized by ortho-phthalaldehyde prior to HPLC analysis. Results: The time zero samples of GACAS passed the physical, chemical, and microbiological tests. Over 2 months of storage, there was no significant change in pH or visual appearance for any of the stability samples. The HPLC results also indicated that the samples retained 101% to 103% of the label claim strengths for both amino acids. Conclusion: The physical and chemical stability of extemporaneously prepared GACAS has been confirmed for up to 2 months in polyolefin IV bags stored under refrigeration. With proper sterile compounding practice and microbiology testing, the BUD of this product can be extended to 2 months

On duality relations for session types

Session types are a type formalism used to describe communication protocols over private session channels. Each participant in a binary session owns one endpoint of a session channel. A key notion is that of duality: the endpoints of a session channel should have dual session types in order to guarantee communication safety. Duality relations have been independently defined in different ways and different works, without considering their effect on the type system. In this paper we systematically study the existing duality relations and some new ones, and compare them in order to understand their expressiveness. The outcome is that those relations are split into two groups, one related to the na¨ıve inductive duality, and the other related to a notion of mutual compliance, which we borrow from the literature on contracts for web-services

Session-Based Role Programming for the Design of Advanced Telephony Applications

International audienceStimulated by new protocols like SIP, telephony applications are rapidly evolving to o er and combine a variety of communications forms including presence status, instant messaging and videoconferencing. This situation changes and complicates significantly the programming of telephony applications that consist now of distributed entities involved into multiple heterogeneous, stateful and long-running interactions. This paper proposes an approach to support the development of SIP-based telephony applications based on general programming language. Our approach combines the concepts of Actor, Session and Role. Role is the part an actor takes in a session and we consider a session as a collaboration between roles. By using these concepts, we are able to break the complexity of SIP entities programming and provide flexibility for defi ning new ones. Our approach is implemented as a coding framework above JAIN-SIP