Correctness of fixpoint transformations (Q1329743)

The paper deals with ``general transformations of equations'', being not concerned with particular utilization of ``many-sorted equational logics'' in theoretical computer science: ``Transformations on a system of equations may change the solution set; those that preserve the desired solutions are called correct transformations. The objective of this paper is to study the correctness of fixed-point transformations in a general setting''. The framework of complete partially ordered sets underlines the presentation. Even if this presentation is very general and appealing (including the use of ordinals and the beauty of the examples), we think that its (declared) main goal (``the results of this paper can be applied to various problems''?!) was not satisfactorily pointed out.