Rast: A Language for Resource-Aware Session Types

Das, Ankush; Pfenning, Frank

doi:10.46298/lmcs-18(1:9)2022

Cited by 7 publications

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Type systems such as the ones discussed in this work lend themselves quite readily to functional term languages [45]. For session types, existing term languages are either inspired in the pi calculus [26,73,69] or in the lambda calculus [35,54,70], or even the two [71]. The system presented in this paper is linear, meaning that resources must be used exactly once [50,74].…”

Section: Related Workmentioning

confidence: 99%

System $$F^\mu _\omega $$ with Context-free Session Types

Poças

Costa

Mordido

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We study increasingly expressive type systems, from $$F^\mu $$ F μ —an extension of the polymorphic lambda calculus with equirecursive types—to $$F^{\mu ;}_\omega $$ F ω μ ; —the higher-order polymorphic lambda calculus with equirecursive types and context-free session types. Type equivalence is given by a standard bisimulation defined over a novel labelled transition system for types. Our system subsumes the contractive fragment of $$F^\mu _\omega $$ F ω μ as studied in the literature. Decidability results for type equivalence of the various type languages are obtained from the translation of types into objects of an appropriate computational model: finite-state automata, simple grammars and deterministic pushdown automata. We show that type equivalence is decidable for a significant fragment of the type language. We further propose a message-passing, concurrent functional language equipped with the expressive type language and show that it enjoys preservation and absence of runtime errors for typable processes.

show abstract

Section: Related Workmentioning

confidence: 99%

System $$F^\mu _\omega $$ with Context-free Session Types

Poças

Costa

Mordido

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This idea essentially started the line of work in automated amortized resource analysis (AARA) that includes automatic heap-space bounds [Hofmann and Jost 2003], analysis of higher-order programs [Jost et al 2010], and a resource-aware version of OCaml (RaML) [Hoffmann et al 2012]. More recently, the combination of AARA and temporal modalities has also been used in the setting of session types to analyze both sequential and parallel cost of message-passing programs [Das et al 2018a,b;Das and Pfenning 2020].…”

Section: Type Systems For Cost Analysismentioning

confidence: 99%

A cost-aware logical framework

Niu

Sterling

Grodin

et al. 2022

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We present calf , a c ost- a ware l ogical f ramework for studying quantitative aspects of functional programs. Taking inspiration from recent work that reconstructs traditional aspects of programming languages in terms of a modal account of phase distinctions , we argue that the cost structure of programs motivates a phase distinction between intension and extension . Armed with this technology, we contribute a synthetic account of cost structure as a computational effect in which cost-aware programs enjoy an internal noninterference property: input/output behavior cannot depend on cost. As a full-spectrum dependent type theory, calf presents a unified language for programming and specification of both cost and behavior that can be integrated smoothly with existing mathematical libraries available in type theoretic proof assistants. We evaluate calf as a general framework for cost analysis by implementing two fundamental techniques for algorithm analysis: the method of recurrence relations and physicist’s method for amortized analysis . We deploy these techniques on a variety of case studies: we prove a tight, closed bound for Euclid’s algorithm, verify the amortized complexity of batched queues, and derive tight, closed bounds for the sequential and parallel complexity of merge sort, all fully mechanized in the Agda proof assistant. Lastly we substantiate the soundness of quantitative reasoning in calf by means of a model construction.

show abstract

The Session Abstract Machine

Caires,

Toninho

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We build on a fine-grained analysis of session-based interaction as provided by the linear logic typing disciplines to introduce the SAM, an abstract machine for mechanically executing session-typed processes. A remarkable feature of the SAM’s design is its ability to naturally segregate and coordinate sequential with concurrent session behaviours. In particular, implicitly sequential parts of session programs may be efficiently executed by deterministic sequential application of SAM transitions, amenable to compilation, and without concurrent synchronisation mechanisms. We provide an intuitive discussion of the SAM structure and its underlying design, and state and prove its correctness for executing programs in a session calculus corresponding to full classical linear logic $$\textsf{CLL}$$ CLL . We also discuss extensions and applications of the SAM to the execution of linear and session-based programming languages.

show abstract

Rast: A Language for Resource-Aware Session Types

Cited by 7 publications

References 25 publications

System $$F^\mu _\omega $$ with Context-free Session Types

System $$F^\mu _\omega $$ with Context-free Session Types

A cost-aware logical framework

The Session Abstract Machine

Contact Info

Product

Resources

About