A dependently typed calculus with pattern matching and erasure inference

Matúš Tejiščák
2020 Proceedings of the ACM on Programming Languages (PACMPL)  
Some parts of dependently typed programs constitute evidence of their type-correctness and, once checked, are unnecessary for execution. These parts can easily become asymptotically larger than the remaining runtime-useful computation, which can cause normally linear-time programs run in exponential time, or worse. We should not make programs run slower by just describing them more precisely. Current dependently typed systems do not erase such computation satisfactorily. By modelling erasure
more » ... irectly through type universes or irrelevance, they impose the limitations of these means to erasure. Some useless computation then cannot be erased and idiomatic programs remain asymptotically sub-optimal. In this paper, we explain why we need erasure, that it is different from other concepts like irrelevance, and propose a dependently typed calculus with pattern matching with erasure annotations to model it. We show that erasure in well-typed programs is sound in that it commutes with reduction. Assuming the Church-Rosser property, erasure furthermore preserves convertibility in general. We also give an erasure inference algorithm for erasure-unannotated or partially annotated programs and prove it sound, complete, and optimal with respect to the typing rules of the calculus. Finally, we show that this erasure method is effective in that it can not only recover the expected asymptotic complexity in compiled programs at run time, but it can also shorten compilation times. This work is licensed under a Creative Commons Attribution 4.0 International License. 91:2 Matúš Tejiščák MOTIVATION The existing approaches do not work well in cases like the presented one with binary numbers. Intrinsic Erasure In Coq, we might attempt to place the indices in Prop, a special universe of (erasable) proof types.
doi:10.1145/3408973 fatcat:ls43oxeho5hvlmvnmmvtqy65jq