Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!watmath!clyde!floyd!harpo!seismo!hao!hplabs!sri-unix!AH From: AH@sri-unix.UUCP Newsgroups: net.ai Subject: Theory of Computation Seminar Message-ID: <16304@sri-arpa.UUCP> Date: Wed, 25-Jan-84 20:07:14 EST Article-I.D.: sri-arpa.16304 Posted: Wed Jan 25 20:07:14 1984 Date-Received: Wed, 8-Feb-84 02:44:04 EST Lines: 7 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