properties of logic programs, eg mode inferencing, type checking, type synthesis, and
properties relevant for and-parallel execution. Most approaches have little in common, they
are developed in an ad hoc way, and their correctness is not always obvious. We develop a
general framework which is suited to develop complex applications and to prove their
correctness. All states which are possible at run time can be represented by an infinite set of …