Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A denotational semantics for Prolog
Nicholson T., Foo N. ACM Transactions on Programming Languages and Systems11 (4):650-665,1989.Type:Article
Date Reviewed: Jun 1 1990

This paper will probably interest devotees of both denotational semantics and Prolog, but few others. The paper requires a fairly high level of sophistication in denotational semantics but only a moderate familiarity with Prolog.

The authors’ primary objective of “precisely defining a core Prolog semantics” seems to have been accomplished in principle. The effectiveness of the definition can be questioned, however, as it is not particularly perspicuous. The backtracking aspect of the Prolog search strategy seems to be the primary source of complexity in the definition. The authors state that continuations handle backtracking conveniently, but the seven continuation domains used in the definition and the resulting complicated semantic valuations do not make comprehension a straightforward matter.

In the latter part of the paper, the semantics of the metapredicate cut is given. Other metapredicates, such as assert and retract, evidently presented greater difficulties, and the authors indicate that they will be addressed in a subsequent paper.

Reviewer:  J. Mack Adams Review #: CR114217
Bookmark and Share
 
Denotational Semantics (F.3.2 ... )
 
 
Logic And Constraint Programming (F.4.1 ... )
 
 
Prolog (F.4.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Denotational Semantics": Date
Category-sorted algebra-based action semantics
Even S., Schmidt D. (ed) Theoretical Computer Science 77(1-2): 73-95, 1990. Type: Article
Nov 1 1991
Domains for logic programming
Filippenko I., Morris F. Theoretical Computer Science 94(1): 63-99, 1992. Type: Article
Apr 1 1993
On the fixpoints of nondeterministic recursive definitions
Chen T. Journal of Computer and System Sciences 29(1): 58-79, 1984. Type: Article
May 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy