AH@sri-unix.UUCP (01/26/84)
two "computational" semantics of PROLOG will be given. One is operational and is expressed as an SECD-style interpreter which is suitable for computer implementation. The other is a Scott-Strachey style denotational semantics. Both were developed from the SLD-refutation procedure of Kowalski and APT and van Embden, and both handle "cut". HOST: Professor Albert R. Meyer