Скачать или смотреть [POPL'24] Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in ...

Polymorphic Reachability Types: Tracking Freshness, Aliasing, and Separation in Higher-Order Generic Programs (Video, POPL 2024)
Guannan Wei, Oliver Bračevac, Songlin Jia, Yuyan Bao, and Tiark Rompf
(Purdue University, USA; Galois, USA / Purdue University, USA; Purdue University, USA; Augusta University, USA; Purdue University, USA)

Abstract: Fueled by the success of Rust, many programming languages are adding substructural features to their type systems. The promise of tracking properties such as lifetimes and sharing is tremendous, not just for low-level memory management, but also for controlling higher-level resources and capabilities. But so are the difficulties in adapting successful techniques from Rust to higher-level languages, where they need to interact with other advanced features, especially various flavors of functional and type-level abstraction. What would it take to bring full-fidelity reasoning about lifetimes and sharing to mainstream languages? Reachability types are a recent proposal that has shown promise in scaling to higher-order but monomorphic settings, tracking aliasing and separation on top of a substrate inspired by separation logic. However, naive extensions on top of the prior reachability type system λ* with type polymorphism and/or precise reachability polymorphism are unsound, making λ* unsuitable for adoption in real languages. Combining reachability and type polymorphism that is precise, sound, and parametric remains an open challenge. This paper presents a rethinking of the design of reachability tracking and proposes new polymorphic reachability type systems. We introduce a new freshness qualifier to indicate variables whose reachability sets may grow during evaluation steps. The new system tracks variables reachable in a single step and computes transitive closures only when necessary, thus preserving chains of reachability over known variables that can be refined using substitution. These ideas yield the simply-typed λ✦-calculus with precise lightweight, i.e., quantifier-free, reachability polymorphism, and the F✦-calculus with bounded parametric polymorphism over types and reachability qualifiers, paving the way for making true tracking of lifetimes and sharing practical for mainstream languages. We prove type soundness and the preservation of separation property in Coq. We discuss various applications (e.g., safe capability programming), possible effect system extensions, and compare our system with Scala’s capture types.

Article: https://doi.org/10.1145/3632856

ORCID: https://orcid.org/0000-0002-3150-2033, https://orcid.org/0000-0003-3569-4869, https://orcid.org/0009-0008-2526-0438, https://orcid.org/0000-0002-3832-3134, https://orcid.org/0000-0002-2068-3238

Video Tags: type systems, reachability types, polymorphism, aliasing, effects, popl24main-p73-p, doi:10.1145/3632856, orcid:0000-0002-3150-2033, orcid:0000-0003-3569-4869, orcid:0009-0008-2526-0438, orcid:0000-0002-3832-3134, orcid:0000-0002-2068-3238

Presentation at the POPL 2024 conference, January 14–20, 2024, https://popl24.sigplan.org/
Sponsored by , https://www.sigplan.org/