Year: 2025
Type: conference-paper
Abstract: 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: Nils Anders Danielsson, Eve Geng
Institutions: Chalmers University of Technology, University of Gothenburg
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Funder: Vetenskapsrådet
OpenAlex ID: W4415002468