Proving termination properties of PROLOG programs
Subtitle: a semantic approach
By: Marianne Baudinet.
Contributors: Stanford University. Computer Science Dept.
Series: Report ;; no. STAN-CS-88-1202; Report (Stanford University. Computer Science Dept.) ;; no. STAN-CS-88-1202.
Publisher: Dept. of Computer Science, Stanford University
Published: 1988
Place of publication: Stanford, Calif
Language: eng
Number of pages: 13
Subjects: Prolog (Computer program language); Programming languages (Electronic computers) -- Semantics; Computer programs -- Correctness; Artificial intelligence
Notes: Includes bibliographical references (p. 11-12).
"March 1988."
"This research was supported by the National Science Foundation under Grants DCR-84-13230 and DCR-86-11272, by the Defense Advanced Research Projects Agency under Contract N00039-84-C-0211, and by the United States Air Force Office of Scientific Research under Contract AFOSR-87-0149"--P. 1.
"To appear in the Proceedings of the Symposium on Logic in Computer Science, IEEE, Edinburgh, Scotland, July 1988"--P. 1.