Verified Linear Session-Typed Concurrent Programming

Das, Ankush; Pfenning, Frank

doi:10.1145/3414080.3414087

Cited by 11 publications

(19 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we present the program constructs we have designed to realize nested polymorphism which have also been integrated with the Rast language [17,18,19] to support general-purpose programming. The underlying base system of session types is derived from a Curry-Howard interpretation [7,8] of intuitionistic linear logic [25].…”

Section: Formal Language Descriptionmentioning

confidence: 99%

See 1 more Smart Citation

Nested Session Types

Das

DeYoung

Mordido

et al. 2021

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

Session types statically describe communication protocols between concurrent message-passing processes. Unfortunately, parametric polymorphism even in its restricted prenex form is not fully understood in the context of session types. In this paper, we present the metatheory of session types extended with prenex polymorphism and, as a result, nested recursive datatypes. Remarkably, we prove that type equality is decidable by exhibiting a reduction to trace equivalence of deterministic first-order grammars. Recognizing the high theoretical complexity of the latter, we also propose a novel type equality algorithm and prove its soundness. We observe that the algorithm is surprisingly efficient and, despite its incompleteness, sufficient for all our examples. We have implemented our ideas by extending the Rast programming language with nested session types. We conclude with several examples illustrating the expressivity of our enhanced type system.

show abstract

Section: Formal Language Descriptionmentioning

confidence: 99%

“…We have implemented nested session types and integrated them with the Rast language that is based on session types [17,18,19]. We have evaluated our prototype on several examples such as the Dyck language [21], an expression server [45] and serializing binary trees, and standard polymorphic data structures such as lists, stacks and queues.…”

Section: Introductionmentioning

confidence: 99%

Nested Session Types

Das

DeYoung

Mordido

et al. 2021

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…It furthermore supports arithmetic type refinements as well as ergometric and temporal types to measure the total work and span of Rast programs. The theory underlying Rast has been developed in several papers, including the Curry-Howard interpretation of linear logic as session-typed processes [CP10,CPT16], the treatment of general equirecursive types and type equality [GH05], asynchronous communication [GV10,DCPT12], ergometric types [DHP18b], temporal types [DHP18a], indexed types [GG13,DP20c], indexed type equality [DP20b], and nested polymorphism [DDMP21].…”

Section: Introductionmentioning

confidence: 99%

“…However, the simple session type does not express the conditions under which the none and some branches must be chosen, which requires tracking the length of the queue. Rast extends session types with arithmetic refinements [DP20b,DP20c] which can be used to express the length of a queue. The more precise type uses the index refinement n to indicate the number of elements in the queue.…”

Section: Introductionmentioning

confidence: 99%

“…Programming in this fully explicit form tends to be unnecessarily verbose, so Rast also provides an implicit language in which most constructs related to index refinements and amortized work analysis are omitted. Explicit programs are then recovered by a prooftheoretically motivated algorithm [DP20c] for reconstruction which is sound and complete on valid implicit programs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Rast: A Language for Resource-Aware Session Types

Das¹,

Pfenning²

2022

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

Traditional session types prescribe bidirectional communication protocols for concurrent computations, where well-typed programs are guaranteed to adhere to the protocols. However, simple session types cannot capture properties beyond the basic type of the exchanged messages. In response, recent work has extended session types with refinements from linear arithmetic, capturing intrinsic attributes of processes and data. These refinements then play a central role in describing sequential and parallel complexity bounds on session-typed programs. The Rast language provides an open-source implementation of session-typed concurrent programs extended with arithmetic refinements as well as ergometric and temporal types to capture work and span of program execution. To further support generic programming, Rast also enhances arithmetically refined session types with recently developed nested parametric polymorphism. Type checking relies on Cooper's algorithm for quantifier elimination in Presburger arithmetic with a few significant optimizations, and a heuristic extension to nonlinear constraints. Rast furthermore includes a reconstruction engine so that most program constructs pertaining the layers of refinements and resources are inserted automatically. We provide a variety of examples to demonstrate the expressivity of the language.

show abstract

Resource-Aware Session Types for Digital Contracts

Das

Balzer

Hoffmann

et al. 2021

2021 IEEE 34th Computer Security Foundations Symposium (CSF)

View full text Add to dashboard Cite

Although I am its author, this dissertation is really a joint e ort. First and foremost, I would like to thank my advisor Jan Ho mann for his unwavering support. Jan, thank you for your patience with me while I learned the basics of programming language theory. Your vision, not just about PL, but about success in research will always stay with me. And a special thanks for your constant guidance during my job application process. I also want to express my sincere gratitude to Frank Pfenning who, despite not being my o cial advisor, always treated me like his student. Frank, your vast experience and clarity of thought has taught me so much about PL research. I really enjoyed my collaborations and pair programming experiences with you; we have created some really impressive so ware together! Before anyone else, I would like to take this opportunity to thank my partner Dr. Shrimai Prabhumoye. Without you, I would not have been able to successfully complete my PhD. e life principles I have learned from you have made me, not just a be er researcher, but a be er person.I would also like to thank my commi ee members: Andrew Miller for introducing me to the world of security, privacy, and applied cryptography; Bryan Parno for providing amazing feedback on my application materials and dissertation; and especially Shaz Qadeer for enabling an awesome internship experience and teaching me how to become an independent researcher. I'd also like to thank all my collaborators:

show abstract

Verified Linear Session-Typed Concurrent Programming

Cited by 11 publications

References 32 publications

Nested Session Types

Nested Session Types

Rast: A Language for Resource-Aware Session Types

Resource-Aware Session Types for Digital Contracts

Contact Info

Product

Resources

About