go-v.orgdoi

Qualifying System F<:: Some Terms and Conditions May Apply

Edward Lee, Yaoyu Zhao, Ondřej Lhoták, James You, Kavin Satheeskumar, Jonathan Immanuel Brachthäuser · Proceedings of the ACM on Programming Languages · 2024

  • DOI 10.1145/3649832
  • Publisher Association for Computing Machinery
  • Type article
  • Issued 2024

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

Proceedings of the ACM on Programming Languages · Association for Computing Machinery · article · 2024

Abstract

Type qualifiers offer a lightweight mechanism for enriching existing type systems to enforce additional, desirable, program invariants. They do so by offering a restricted but effective form of subtyping. While the theory of type qualifiers is well understood and present in many programming languages today, polymorphism over type qualifiers remains an area less well examined. We explore how such a polymorphic system could arise by constructing a calculus, System F-sub-Q, which combines the higher-rank bounded polymorphism of System F-sub with the theory of type qualifiers.

We explore how the ideas used to construct System F-sub-Q can be reused in situations where type qualifiers naturally arise---in reference immutability, function colouring, and capture checking. Finally, we re-examine other qualifier systems in the literature in light of the observations presented while developing System F-sub-Q.

Open the resolved locator · 10.1145/3649832

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-19 21:55 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
http://dx.doi.org/10.1145/3649832
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.