Anti-Unification with Type Classes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Anti-Unification with Type Classes


The anti-unification problem is that of finding the most specific pattern of two terms. While dual to the unification problem, anti-unification has rarely been considered at the level of types. In this paper, we present an algorithm to compute the least general type of two types in Haskell, using the logic programming power of type classes. That is, we define a type class for which the type class instances resolution performs anti-unification. We then use this type class to define a type-safe embedding of aspects in Haskell.
Fichier principal
Vignette du fichier
main.pdf (272.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00765862 , version 1 (17-12-2012)


  • HAL Id : hal-00765862 , version 1


Nicolas Tabareau, Éric Tanter, Ismael Figueroa. Anti-Unification with Type Classes. Journées Francophones des Langages Applicatifs (JFLA), Feb 2013, Aussois, France. ⟨hal-00765862⟩
302 View
233 Download


Gmail Facebook X LinkedIn More