Some considerations on the compile-time analysis of constraint logic programs

摘要: This paper discusses some issues which arise in the dataflow analysis of constraint logic programming (CLP) languages. The basic technique applied is that abstract interpretation. First, types optimizations possible a number CLP systems (including efficient parallelization) are presented and information has to be obtained at compile-time order able implement such considered. Two approaches then proposed discussed for obtaining this program: one based on an metainterpreter using standard Prolog tools, second direct program. For approach domain approximates groundness (also referred as "definiteness") (i.e. single value) related abstraction functions presented.