A. Tellez-Arenas

Learn More
Existing approaches to deal with sets in a CLP framework generally assume the niteness of the subjacent sets: that is a reason why intensional sets are often forbidden. In this paper, we propose a new compilation method to treat intensional sets in a general setting. Our representation relies on a simply typed-calculus: sets are considered as Boolean-valued(More)
Set constraints are naturally involved in many computer science areaa and there is a large agreement to recognize the availability of set data abstractions as a valuable feature in programming or specification languages. At this time, the main problem is the choice of a relevant implementation support for such dataa. Most previous works deals with finite(More)
A lot of attention has been paid to the integration of sets into constraint logic programming languages because they lead to concise and elegant formulations of a number of interesting problems. However, existing approaches generally assume the niteness of the subjacent sets: that is a reason why intensional sets are often forbidden. We propose here a(More)
  • 1