We investigate an interesting combination of functional and concurrent programming. The concurrent part contains processes as first-class objects and allows to pass channels as values. We insist, however, that channels are directed and connect at most two processes. This property is ensured by a type inference system based on linear types. We also show that channels are in some sense universal for implementing linear abstract datatypes
In this paper we develop a sound and complete type and behaviour inference algorithm for a fragment ...
We investigate strong normalization, confluence, and behavioral equality in the realm of session-bas...
International audienceWe build a realizability model for linear logic using a name-passing process c...
AbstractWe present a small programming language for distributed systems based on message passing pro...
In prior work we proposed an interpretation of intuitionistic linear logic propositions as session t...
International audienceWe propose a type-based analysis to infer the session protocols of channels in...
Enhancing the type system of a programming language brings benefits on many fronts. We define and ex...
Session types and typestate both promise a type system that can reason about protocol adherence. The...
We introduce a novel way to integrate functional and concurrent programming based on intuitionistic...
We explore the role of types in models of concurrent computation, particularly in the concrete setti...
Linear logic has long been heralded for its potential of providing a logical basis for concurrency. ...
We present a unifying framework for type systems for process calculi. The core of the system provide...
In a concurrent functional language processes are functions that are executed concurrently. Using sp...
Abstract. This paper presents a logical approach to the translation of functional calculi into concu...
This dissertation investigates different formalisms, in the form of programming language calculi, th...
In this paper we develop a sound and complete type and behaviour inference algorithm for a fragment ...
We investigate strong normalization, confluence, and behavioral equality in the realm of session-bas...
International audienceWe build a realizability model for linear logic using a name-passing process c...
AbstractWe present a small programming language for distributed systems based on message passing pro...
In prior work we proposed an interpretation of intuitionistic linear logic propositions as session t...
International audienceWe propose a type-based analysis to infer the session protocols of channels in...
Enhancing the type system of a programming language brings benefits on many fronts. We define and ex...
Session types and typestate both promise a type system that can reason about protocol adherence. The...
We introduce a novel way to integrate functional and concurrent programming based on intuitionistic...
We explore the role of types in models of concurrent computation, particularly in the concrete setti...
Linear logic has long been heralded for its potential of providing a logical basis for concurrency. ...
We present a unifying framework for type systems for process calculi. The core of the system provide...
In a concurrent functional language processes are functions that are executed concurrently. Using sp...
Abstract. This paper presents a logical approach to the translation of functional calculi into concu...
This dissertation investigates different formalisms, in the form of programming language calculi, th...
In this paper we develop a sound and complete type and behaviour inference algorithm for a fragment ...
We investigate strong normalization, confluence, and behavioral equality in the realm of session-bas...
International audienceWe build a realizability model for linear logic using a name-passing process c...