A Formalization of Opaque Definitions for a Dependent Type Theory
Definitions allow for reuse of code. Typical type-checkers for dependently typed programming languages automatically unfold definitions, but excessive unfolding can lead to types that are hard to read, or performance issues. Such problems can be mitigated through the use of opaque definitions, which give the programmer control over when unfolding is allowed. However, subject reduction fails to hold for certain designs.
Authors
- E. Geng
- Nils Anders Danielsson
Institutions
- Chalmers University of Technology (SE)
- University of Gothenburg (SE)
Publication Details
- Published
- 2025-10-09
- DOI
- https://doi.org/10.1145/3759538.3759653
- Primary Topic
- Logic, programming, and type systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Vetenskapsrådet