Subtyping constraints in quasi-lattices - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

Subtyping constraints in quasi-lattices

Emmanuel Coquery
Francois Fages


In this report, we show the decidability and NP-completeness of the satisfiability problem for non-structural subtyping constraints in quasi-lattices. This problem, first introduced by Smolka in 1989, is important for the typing of logic and functional languages. The decidability result is obtained by generalizing Trifonov and Smith's algorithm over lattices, to the case of quasi-lattices. Similarly, we extend Pottier's algorithm for computing explicit solutions to the case of quasi-lattices. Finally we evoke some applications of these results to type inference in constraint logic programming and functional programming languages.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4926.pdf (196.13 Ko) Télécharger le fichier

Dates and versions

inria-00071653 , version 1 (23-05-2006)


  • HAL Id : inria-00071653 , version 1


Emmanuel Coquery, Francois Fages. Subtyping constraints in quasi-lattices. [Research Report] RR-4926, INRIA. 2003. ⟨inria-00071653⟩
86 View
173 Download


Gmail Facebook Twitter LinkedIn More