Dice Question Streamline Icon: https://streamlinehq.com

Automate precise computation of location upper-bound annotations in the local type system

Develop and validate a static analysis or typing mechanism that automatically computes precise upper bounds ρ for the local types loc_ρ and locset_ρ—used to represent locations and location sets—in the local language of Lambda-QC, eliminating the need to supply these annotations manually while preserving type soundness.

Information Square Streamline Icon: https://streamlinehq.com

Background

Lambda-QC’s local type system includes types loc_ρ and locset_ρ to represent locations and sets of locations, where ρ is a static upper bound on the possible runtime resolution. The current development assumes these bounds are provided directly as annotations by the local type system.

The authors suggest these bounds could be inferred by refinement types or separate static analyses, but they do not implement such inference and explicitly defer precise computation to future work.

References

In this work, we assume for simplicity that the annotations are given directly by the local type system, and leave computing them precisely to future work.

Choreographic Quick Changes: First-Class Location (Set) Polymorphism (2506.10913 - Samuelson et al., 12 Jun 2025) in Section 3.1, Local Kinding and Type System