<p>Trifonov and Smith's <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.5192">Subtyping Constrained Types</a> (1996) introduces constraint maps to represent consistent closed constraint sets (such maps providing sets of lower and upper bounds to each variable in their domain), and canonical constraint maps for which each variable has exactly one constructed upper and one constructed lower bound. They note that constraint maps and canonical constraint maps have potential as an implementation technique.</p>

<p>However, the work I am familiar with on algorithms for polymorphic type inference in the presence of constraints (essentially, Pottier and Rémy's <a href="http://cristal.inria.fr/attapl/">The essence of ML type inference</a>, and the range of research cited therein -- also see Simonet's <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.6659">Type inference with structural subtyping</a>, and Odersky, Sulzmann and Wehr's <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.1443">Type inference with constrained types</a>) does not appear to use the constraint map representation.</p>

<p>Have Trifonov and Smith's constraint maps been put to use in any published works (or actual implementations in the wild)? Were there any obstacles to doing so, or was this line of research simply not pursued?</p>

CC BY-SA 2.5
2010-08-30T19:03:05.150Z
have you checked here? (all papers that cite it) http://scholar.google.com/scholar?cites=8643669302158453961&as_sdt=2005&sciodt=2000&hl=en
Ryan Williams
CC BY-SA 2.5
2010-08-30T19:11:47.220Z
Thanks for the link. I've looked at a fair amount of those, but certainly not all. The basic result of the paper is very well cited, but in what I've seen there's been no use of constraint maps.
sclv
<ds.algorithms><pl.programming-languages><type-inference><type-theory><polymorphism>
Type inference with subtype constraints and polymorphism using Trifonov and Smith's constraint maps
sclv
# Type inference with subtype constraints and polymorphism using Trifonov and Smith's constraint maps

(Asked by: username_0 on 2010-08-27)

Trifonov and Smith's [Subtyping Constrained Types](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.5192) (1996) introduces constraint maps to represent consistent closed constraint sets (such maps providing sets of lower and upper bounds to each variable in their domain), and canonical constraint maps for which each variable has exactly one constructed upper and one constructed lower bound. They note that constraint maps and canonical constraint maps have potential as an implementation technique.

However, the work I am familiar with on algorithms for polymorphic type inference in the presence of constraints (essentially, Pottier and Rémy's [The essence of ML type inference](http://cristal.inria.fr/attapl/), and the range of research cited therein -- also see Simonet's [Type inference with structural subtyping](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.6659), and Odersky, Sulzmann and Wehr's [Type inference with constrained types](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.1443)) does not appear to use the constraint map representation.

Have Trifonov and Smith's constraint maps been put to use in any published works (or actual implementations in the wild)? Were there any obstacles to doing so, or was this line of research simply not pursued?

**Tags:** ds.algorithms, pl.programming-languages, type-inference, type-theory, polymorphism
> **Comments:**
> **username_1**: have you checked here? (all papers that cite it) http://scholar.google.com/scholar?cites=8643669302158453961&as_sdt=2005&sciodt=2000&hl=en  
> **username_0**: Thanks for the link. I've looked at a fair amount of those, but certainly not all. The basic result of the paper is very well cited, but in what I've seen there's been no use of constraint maps.  

---

## 0 answers

