DeepAI AI Chat
Log In Sign Up

On Polymorphic Sessions and Functions: A Tale of Two (Fully Abstract) Encodings

by   Bernardo Toninho, et al.

This work exploits the logical foundation of session types to determine what kind of type discipline for the pi-calculus can exactly capture, and is captured by, lambda-calculus behaviours. Leveraging the proof theoretic content of the soundness and completeness of sequent calculus and natural deduction presentations of linear logic, we develop the first mutually inverse and fully abstract processes-as-functions and functions-as-processes encodings between a polymorphic session pi-calculus and a linear formulation of System F. We are then able to derive results of the session calculus from the theory of the lambda-calculus: (1) we obtain a characterisation of inductive and coinductive session types via their algebraic representations in System F; and (2) we extend our results to account for value and process passing, entailing strong normalisation.


page 1

page 2

page 3

page 4


Depending on Session-Typed Processes

This work proposes a dependent type theory that combines functions and s...

Session Type Systems based on Linear Logic: Classical versus Intuitionistic

Session type systems have been given logical foundations via Curry-Howar...

Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)

We study encodings of the lambda-calculus into the pi-calculus in the un...

Separating Sessions Smoothly

This paper introduces Hypersequent GV (HGV), a modular and extensible co...

A subexponential view of domains in session types

Linear logic (LL) has inspired the design of many computational systems,...

Circular Proofs as Session-Typed Processes: A Local Validity Condition

Proof theory provides a foundation for studying and reasoning about prog...

On the characterization of models of H* : The operational aspect

We give a characterization, with respect to a large class of models of u...