The use of standard instances of the CLP framework (e.g. CLP(Bool) and CLP('R» for non-standard (possibly abstract) interpretations, weakens the dis­ tinction between concrete and abstract computations in semantics and analysis. We formalize this idea by applying the well known approximation techniques (e.g. the standard theory of closure operators) in conjunction with a generalized no­ tion of constraint system, supporting any program evaluation. The "generalized semantics" resulting from this process, abstracts away from standard semantic objects, by focusing on the general properties of any (possibly non-standard) semantic definition. In constraint logic programming, this corresponds to a suit­ able definition of the constraint system supporting the semantic definition. Both top-down and a bottom-up semantics are considered.
['Roberto Giacobazzi', 'Giorgio Levi', 'Saumya K. Debray']
Joining Abstract and Concrete Computations in Constraint Logic Programming