Some interesting communication protocols can be precisely described only by context-free session types, an extension of conventional session types supporting a general form of sequential composition. The complex metatheory of context-free session types, however, hinders the definition of corresponding checking and inference algorithms. In this work, we study a new syntax-directed type system for context-free session types that is easy to embed into a host programming language. We also detail 2 OCaml embeddings that allow us to piggyback on OCaml’s type system to check and infer context-free session types.

中文翻译：

---

上下文无关的会话类型推断

一些有趣的通信协议只能通过上下文无关的会话类型来精确描述，这是传统会话类型的扩展，支持一般形式的顺序组合。然而，上下文无关会话类型的复杂元理论阻碍了相应检查和推理算法的定义。在这项工作中，我们研究了一种用于上下文无关会话类型的新语法导向类型系统，该类型系统易于嵌入到主机编程语言中。我们还详细介绍了 2 个 OCaml 嵌入，它们允许我们搭载 OCaml 的类型系统来检查和推断无上下文会话类型。