Two Congruent Semantics for Prolog with CUT

The development of a formal semantics for a given programming language can proceed in several stages. At each stage we give an alternative semantic definition of the language, and each definition embodies successively more and more implementation details. Then we formulate and prove at each stage the congruence conditions between successive definitions in the sequence. This paper presents two formal semantics for Prolog with “cut” and shows the congruence condition between them.