Tim Nicholson
Abstract
A denotational semantics is presented for the language Pro.og. Metapredicates are not considered. Conventional control sequencing is assumed for Prolog's execution. The semantics is nonstandard, and goal continuations are used to explicate the sequencing.
- 1 APT, K. R., AND VAN EMDEN, M.H. Contributions to the theory of logic programming. J. ACM 29, 3 (July 1982), 841-862. Google Scholar
- 2 CLOCKSIN, W. F., AND MELLISH, C.S. Programming in Prolog. Springer, New York, 1981. Google Scholar
- 3 GORDON, M. J. C. The Denotational Description of Programming Languages. Springer, New York, 1979. Google Scholar
- 4 KOWALSKI, R. Algorithm = logic + control. Commun. ACM 22, 7 (July 1979), 424-436. Google Scholar
- 5 JONES, N. D., AND MYCROFT, A. Stepwise development of operational and denotationa} semantics for Prolog. In 1984 International Symposium on Logic Programming (Atlantic City, N.J., Feb. 1984). IEEE Computer Society Press, Washington, D.C., 1984, pp. 281-288.Google Scholar
- 6 STOY, J.E. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge, Mass., 1977. Google Scholar
- 7 WAND, M. Deriving target code as a representation of continuation semantics. ACM Trans. Program. Lang. Syst. 4, 3 (July 1982), 496-517. Google Scholar
- 8 WAND, M. A semantic algebra for logic programming. Tech. Rep. 148, Computer Science Dept., Indiana Univ., Aug. 1983.Google Scholar
Index Terms
- A denotational semantics for Prolog
Recommendations
A Denotational Semantics for Circus
Circus specifications define both data and behavioural aspects of systems using a combination of Z and CSP. Previously, a denotational semantics has been given to Circus; however, as a shallow embedding of Circus in Z, it was not possible to use it to ...
On Denotational Semantics of Spatial-Temporal Consistency Language -- STeC
TASE '13: Proceedings of the 2013 International Symposium on Theoretical Aspects of Software EngineeringIn order to describe the requirement of spatial and temporal consistency of cyber-physical systems, a specification language called as STeC was proposed by Chen in [1]. In this paper, we focus on the theory of semantics of STeC. After simply restating ...
Reviews
J. Mack Adams
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.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments