Skip to Main content Skip to Navigation

Subtyping constraints in quasi-lattices

Emmanuel Coquery 1 Francois Fages 1 
1 CONTRAINTES - Constraint programming
Inria Paris-Rocquencourt
Abstract : 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.
Document type :
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 6:24:33 PM
Last modification on : Friday, February 4, 2022 - 3:07:54 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:31:30 PM


  • HAL Id : inria-00071653, version 1



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



Record views


Files downloads