… in a novel sequent-calculus-style formulation that allows us … expressive type systems and
automatic memory management)… (including some related to memory management). We expose …

… λμ μ-calculus. We design a minimal language with a value restriction and a type system that
… of classical proofs, using control operators and their ability to backtrack. Several calculi were …

… (in the style of ML) typed lambda calculus, and show how to … typed lambda calculus can
be extended to support effects with a monadic type discipline, an impure typed lambda calculus …

… 6 RELATED WORK The calculus presented in this paper builds on different lines of work, …
Their motivation is to make region-based memory management safe. The underlying problem …

… 3.3 Translation of λCap to STLC In this subsection, we describe the semantics of λCap in
terms of a translation to simply-typed lambda calculus [Barendregt 1992], extended with a …

… capabilities, a type of capabilities offered by CHERI to temporarily relinquish authority, namely
for the duration of a function invocation whereafter the capability … lambda calculus settings, …

… We represent closed functions and closures as variants of the same type. Correspondingly
… To reduce memory usage and runtime overhead, it should be possible to automatically …

… real-valued functions. En route to the aert calculus, we study the ert calculus for reasoning
… Since we have an in nite reservoir of locations, memory allocation never fails. The mutation …

… Calculus constructs—see below); • a let-style statement t x = e1; e2, declaring a variable x of
type t … t x, return type tr, and body e: since anonymous functions capture variables defined in …

… connection between a feature in a process calculus and a corresponding feature in a
programming … We give a type system and operational semantics for each calculus, and precisely …