Intrinsically-Typed Mechanized Semantics for Session Types

Thiemann, Peter

doi:10.1145/3354166.3354184

Cited by 15 publications

(12 citation statements)

References 39 publications

(52 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The overhead of these proof terms obscures the computational content of the interpreter and makes writing them a tedious exercise. This manipulation of separation proofs in intrinsically-typed semantics of linear languages has previously been identified as a key issue of the approach [37].…”

Section: The Type Of a Linear Interpretermentioning

confidence: 99%

See 1 more Smart Citation

Intrinsically-typed definitional interpreters for linear, session-typed languages

Rouvoet

Poulsen

Krebbers

et al. 2020

Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs

View full text Add to dashboard Cite

An intrinsically-typed definitional interpreter is a concise specification of dynamic semantics, that is executable and type safe by construction. Unfortunately, scaling intrinsicallytyped definitional interpreters to more complicated object languages often results in definitions that are cluttered with manual proof work. For linearly-typed languages (including session-typed languages) one has to prove that the interpreter, as well as all the operations on semantic components, treat values linearly. We present new methods and tools that make it possible to implement intrinsically-typed definitional interpreters for linearly-typed languages in a way that hides the majority of the manual proof work. Inspired by separation logic, we develop reusable and composable abstractions for programming with linear operations using dependent types. Using these abstractions, we define interpreters for linear lambda calculi with strong references, concurrency, and session-typed communication in Agda.

show abstract

Section: The Type Of a Linear Interpretermentioning

confidence: 99%

“…The most closely related work on semantics for session-typed languages is an intrinsically-typed small-step operational semantics in Agda by Thiemann [37]. The session-typed language that he uses is a superset of ours.…”

Section: Intrinsically-typed Session-type Semanticsmentioning

confidence: 99%

Intrinsically-typed definitional interpreters for linear, session-typed languages

Rouvoet

Poulsen

Krebbers

et al. 2020

Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs

View full text Add to dashboard Cite

show abstract

“…Following Benton et al [2], Thiemann [29], Wadler and Kokke [33], we use intrinsically typed terms and processes where names are referenced through their de Brujin index. There is one key difference with these works, though, which allows us to intertwine the dlπ process layer and the Agda functional layer.…”

Section: Agda Formalizationmentioning

confidence: 99%

“…Formalizations of session type systems. Thiemann [29] gives the first mechanized proof of a calculus of functions and sessions. His type system distinguishes between types and session types, but only non-dependent pairs are considered.…”

Section: Related Workmentioning

confidence: 99%

A Dependently Typed Linear π-Calculus in Agda

Ciccone

Padovani

2020

Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

Session types have consolidated as a formalism for the specification and static enforcement of communication protocols. Many different theories of dependent session types have been proposed, some enabling refined specifications on the content of messages, others allowing the structure of the protocols to depend on data exchanged in the protocol itself. In this work we continue a line of research studying the foundations of binary session types. In particular, we propose a variant of the linear π-calculus whose type structure encompasses virtually all dependent session types using just two type constructors: linear channel types and linear dependent pairs. We use Agda not only to formalize the metatheory of the calculus and obtain machine-checked proofs of type soundness, but also as host language in which we implement data-dependent protocols.

show abstract

“…Finally, formalisations of session types in proof assistants exist in the literature (e.g. : [21,24,19,16,9]). Most of them with ad-hoc binder representations.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

EMTST: Engineering the Meta-theory of Session Types

Castro

Ferreira

Yoshida

2020

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Session types provide a principled programming discipline for structured interactions. They represent a wide spectrum of type-systems for concurrency. Their type safety is thus extremely important. EMTST is a tool to aid in representing and validating theorems about session types in the Coq proof assistant. On paper, these proofs are often tricky, and error prone. In proof assistants, they are typically long and difficult to prove. In this work, we propose a library that helps validate the theory of session types calculi in proof assistants. As a case study, we study two of the most used binary session types systems: we show the impossibility of representing the first system in $$\alpha $$-equivalent representations, and we prove type preservation for the revisited system. We develop our tool in the Coq proof assistant, using locally nameless for binders and small scale reflection to simplify the handling of linear typing environments.

show abstract

Intrinsically-Typed Mechanized Semantics for Session Types

Cited by 15 publications

References 39 publications

Intrinsically-typed definitional interpreters for linear, session-typed languages

Intrinsically-typed definitional interpreters for linear, session-typed languages

A Dependently Typed Linear π-Calculus in Agda

EMTST: Engineering the Meta-theory of Session Types

Contact Info

Product

Resources

About