Some Fixpoint Techniques in Algebraic Structures and Applications to Computer Science
Irène Guessarian · Fundamenta Informaticae · 1987
This paper recalls some fixpoint theorems in ordered algebraic structures and surveys some ways in which these theorems are applied in computer science. We describe via examples three main types of applications: in semantics and proof theory, in logic programming and in deductive data bases.