Declarative Programming in Prolog (1993)
Cached
Download Links
- [homepages.cwi.nl]
- [www.cwi.nl]
- [www.cwi.nl]
- DBLP
Other Repositories/Bibliography
| Venue: | Logic Programming - Proceedings of the 1993 International Symposium |
| Citations: | 21 - 3 self |
BibTeX
@INPROCEEDINGS{Apt93declarativeprogramming,
author = {Krzysztof R. Apt},
title = {Declarative Programming in Prolog},
booktitle = {Logic Programming - Proceedings of the 1993 International Symposium},
year = {1993},
pages = {12--35},
publisher = {The MIT Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We try to assess to what extent declarative programming can be realized in Prolog and which aspects of correctness of Prolog programs can be dealt with by means of declarative interpretation. More specifically, we shall discuss termination of Prolog programs, partial correctness, absence of errors and the safe use of negation. 1991 Mathematics Subject Classification: 68Q40, 68T15. CR Categories: F.3.2., F.4.1, H.3.3, I.2.3. Keywords and Phrases: declarative programming, Prolog programs, verification. Notes. This research was partly supported by the ESPRIT Basic Research Action 6810 (Compulog 2). This paper will appear as invited lecture in: Proc. of International Logic Programming Symposium (ILPS '93), The MIT Press, D. Miller (editor). It also appeared as a Technical Report No CT-93-06 in the ILLC Prepublication Series of the University of Amsterdam. 1
