Towards Refinement by Resolution in Dependent Type Theory – František Farka
Abstract Dependent types are increasingly used in functional programming languages. The surface syntax of dependent types, as seen by a programmer, is elaborated by a compiler into an internal, type-theoretic representation. In order to perform this step, the compiler needs to infer a nontrivial amount of information to successfully type-check the internal representation. This process—type … Towards Refinement by Resolution in Dependent Type Theory – František Farka