• Publications
  • Influence
Higher-Order Processes, Functions, and Sessions: A Monadic Integration
TLDR
This paper uniformly integrating a Curry-Howard interpretation of linear sequent calculus as session-typed processes in a functional language via a linear contextual monad that isolates session-based concurrency through a logical foundation for higher-order session typed processes. Expand
Linear logic propositions as session types
TLDR
A type system for the π-calculus is proposed that corresponds to a standard sequent calculus presentation of intuitionistic linear logic, interpreting linear propositions as session types and thus providing a purely logical account of all key features and properties of session types. Expand
Fencing off go: liveness and safety for channel-based programming
TLDR
This work develops a static verification framework for bounded liveness and safety in Go programs, able to detect communication errors and partial deadlocks in a general class of realistic concurrent programs, including those with dynamic channel creation and infinite recursion. Expand
Dependent session types via intuitionistic linear type theory
TLDR
An interpretation of linear type theory as dependent session types for a term passing extension of the pi-calculus is developed, which allows for rich constraints on sessions, such as interface contracts and proof-carrying certification, which go beyond existing session type systems. Expand
A Static Verification Framework for Message Passing in Go Using Behavioural Types
TLDR
This work proposes a practical verification framework for message passing concurrency in Go by developing a robust static analysis that infers an abstract model of a program's communication behaviour in the form of a behavioural type, a powerful process calculi typing discipline. Expand
Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication
TLDR
A new process assignment from the asynchronous, polyadic pi-calculus to exactly the same proof rules is exhibited, showing that, under this new asynchronous interpretation, cut reductions correspond to a natural asynchronous buffered session semantics, where each session is allocated a separate communication buffer. Expand
Towards concurrent type theory
TLDR
Progress is reviewed in a recent line of research that provides a concurrent computational interpretation of (intuitionistic) linear logic that satisfies the properties of type preservation, progress, and termination, as expected from a language derived via a Curry-Howard isomorphism. Expand
Behavioral Polymorphism and Parametricity in Session-Based Communication
TLDR
A logically motivated theory of parametric polymorphism, reminiscent of the Girard-Reynolds polymorphic λ-calculus, but casted in the setting of concurrent processes, which derives non-trivial results about internal protocol independence, a concurrent analogous of representation independence, and non-interference properties of modular, distributed systems. Expand
Proof-Carrying Code in a Session-Typed Process Calculus
TLDR
Two modal operators are introduced into the type theory to provide detailed control about how much information is communicated: one based on traditional proof irrelevance and one integrating digital signatures. Expand
Corecursion and Non-divergence in Session-Typed Processes
TLDR
This paper addresses the challenge of ensuring non-divergence in a session-typed \(\pi \)-calculus with general (co)recursion, while still allowing interesting infinite behaviors to be definable, and proves type safety for the framework, implying protocol compliance and global progress of well-typing processes. Expand
...
1
2
3
4
5
...