## Concoqtion: Mixing dependent types and Hindley-Milner type inference (extended version (2006)

Citations: | 2 - 0 self |

### BibTeX

@TECHREPORT{Siek06concoqtion:mixing,

author = {Jeremy Siek and Walid Taha},

title = {Concoqtion: Mixing dependent types and Hindley-Milner type inference (extended version},

institution = {},

year = {2006}

}

### OpenURL

### Abstract

This paper addresses the question of how to extend OCaml’s Hindley-Milner type system with types indexed by logical propositions and proofs of the Coq theorem prover, thereby providing an expressive and extensible mechanism for ensuring fine-grained program invariants. We propose adopting the approached used by Shao et al. for certified binaries. This approach maintains a phase distinction between the computational and logical languages, thereby limiting effects and non-termination to the computational language, and maintaining the decidability of the type system. The extension subsumes language features such as impredicative first-class (higher-rank) polymorphism and type operators, that are notoriously difficult to integrate with the Hindley-Milner style of type inference that is used in OCaml. We make the observation that these features can be more easily integrated with type inference if the inference algorithm is free to adapt the order in which it solves typing constraints to each program. To this end we define a novel “order-free ” type inference algorithm. The key enabling technology is a graph representation of constraints and a constraint solver that performs Hindley-Milner inference with just three graph rewrite rules. 1