2023/01/05 by Guillaume Allais, Allais, Guillaume · 1 citation
Computer Science · #D.2.4 #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #Parallel Computing and Optimization Techniques #Programming Languages (cs.PL) #Software Engineering Research
paper · pdf · doi:10.48550/arxiv.2301.02194
openalex publication_date 2023/01/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
State of the art optimisation passes for dependently typed languages can help erase the redundant information typical of invariant-rich data structures and programs. These automated processes do not dramatically change the structure of the data, even though more efficient representations could be available. Using Quantitative Type Theory, we demonstrate how to define an invariant-rich, typechecking time data structure packing an efficient runtime representation together with runtime irrelevant invariants. The compiler can then aggressively erase all such invariants during compilation. Unlike other approaches, the complexity of the resulting representation is entirely predictable, we do not require both representations to have the same structure, and yet we are able to seamlessly program as if we were using the high-level structure.