Session types provide a typing discipline for structured communication on bidirectional
channels. Context-free session types overcome the restriction to tail recursive protocols …

Programming digital contracts comes with unique challenges, which include (i) expressing
and enforcing protocols of interaction,(ii) controlling resource usage, and (iii) preventing the …

We study increasingly expressive type systems, from Fµ—an extension of the polymorphic
lambda calculus with equirecursive types—to Fµ; ω—the higher-order polymorphic lambda …

We study the interaction of structural subtyping with parametric polymorphism and
recursively defined type constructors. Although structural subtyping is undecidable in this …

Many type systems include infinite types. In session type systems, infinite types are important
because they specify communication protocols that are unbounded in time. Usually infinite …

Polarization of types in call-by-push-value naturally leads to the separation of inductively
defined observable values (classified by positive types), and coinductively defined …

We present an extension of System F with higher-order context-free session types. The
mixture of functional types with session types has proven to be a challenge for type …

We propose algebraic protocols that enable the definition of protocol templates and session
types analogous to the definition of domain-specific types with algebraic datatypes …

Context-free session types describe structured patterns of communication on
heterogeneously-typed channels, allowing the specification of protocols unconstrained by …

Compositional methods are central to the verification of software systems. For concurrent
and communicating systems, compositional techniques based on behavioural type systems …