Cited By
View all- Lamma EMello PRossi G(2018)Parametric composable modules in a logic programming languageComputer Languages10.1016/0096-0551(93)90014-R18:2(105-123)Online publication date: 23-Dec-2018
MS-DOS Prolog implementations revisited
Abstract
In an earlier article [11] we proposed a taxonomy for classification of PROLOG implementations. This analysis has been used by ourselves [1], [3], [11] and others [6] in evaluation of current microcomputer-based products. However, it has become out of date for several reasons. First, PROLOG has matured to the point where the language kernels have become comparable in functionality. Thus, many of the features which distinguished products a few years ago no longer do so. Conversely, increasing attention is being paid to extra-and metalogical support, so that there are now features which are distinguishing which were not, only a few years back. It is now quite reasonable to expect a PROLOG implementation to support graphics, virtual memory, modularization, and so forth. Thus, we offer a revision which is more in keeping with the current PROLOG offerings.
References
[1]
[1] Berghel, H., R. Rankin, T. Rocha and C. Yi, "ALS PROLOG Compiler", IEEE TC/PC Newsletter, IEEE Computer Society, June, 1987, pp. 1-4.
[2]
[2] Berghel, H., G. Stubbendieck and E. Traudt, "Performance Characteristics of Microcomputer Prolog Implementations", Proceedings of the 1986 ACM Sigsmall/PC Symposium on Small Systems, ACM, December, 1986, pp. 64-71.
[3]
[3] Berghel, H. and R. Rankin, "PROLOG: the State-of-the-Art", Proceedings of NCC-87, AFIPS Press, June, 1987, pp. 27- 35.
[4]
[4] Bhatia, S., R. Rankin and H. Berghel, "Taxonomy for the Feature Analysis of Prolog Implementations", Technical Report CSAS-TR-87-15, Department of Computer Science, University of Arkansas, September, 1987.
[5]
[5] Clocksin, W. and C. Mellish, Programming in Prolog, Springer Verlag, New York, 1981.
[6]
[6] Hankley, W., "Feature Analysis of Turbo Prolog", SIGPLAN Notices, Vol. 22, No. 3, March, 1987, pp. 111-118.
[7]
[7] O'Keefe, R., "Draft Proposed Standard for Prolog Evaluable Predicates", DAI Working Paper, Department of Artificial Intelligence, University of Edinburgh, April, 1984.
[8]
[8] O'Keefe, R., "On Standardizing Prolog", DAI Working Paper, Department of Artificial Intelligence, University of Edinburgh, October, 1984.
[9]
[9] O'Keefe, R., "Formal Definition in Prolog", Technical Report #85-1, Quintus Computer Systems, December, 1984.
[10]
[10] Rankin, R. and H. Berghel, "A Compendium of Prolog Benchmarks", Technical Report CSAS-TR-87-04, Department of Computer Science, University of Arkansas, June, 1987.
[11]
[11] Weeks, J. and H. Berghel, "A Comparative Analysis of Microcomputer Prolog Implementations", SIGPLAN Notices, Vol. 21, No. 2, Feb., 1986, pp. 46-61.
[12]
[12] Weeks, J. and H. Berghel, "TURBO + PROLOG", IEEE TC/PC Newsletter, IEEE Computer Society, October, 1986, pp. 1-7.
[13]
[13] Wilk, P., "The Production and Evaluation of a Set of Prolog Benchmarks", Report AIAI-TR-13, Artificial Intelligence Applications Institute, University of Edinburgh, revised, January, 1986.
[14]
[14] Wilk, P., "Prolog Benchmarking", Report AIAI-TR-14, Artificial Intelligence Applications Institute, University of Edinburg, January, 1986.
Index Terms
- MS-DOS Prolog implementations revisited
Recommendations
Towards a jitting VM for prolog execution
PPDP '10: Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programmingMost Prolog implementations are implemented in low-level languages such as C and are based on a variation of the WAM instruction set, which enhances their performance but makes them hard to write. In addition, many of the more dynamic features of Prolog ...
How to define a language using PROLOG
LFP '82: Proceedings of the 1982 ACM symposium on LISP and functional programmingThere have been many papers, conferences and theses concerned with the task of defining programming languages. Yet, twenty years after McCarthy's (1962) seminal paper there is still no widely accepted method which will deal with all parts of a language ...
Bousi~Prolog: a Prolog Extension Language for Flexible Query Answering
In this paper we present the main features and implementation details of a programming language that we call Bousi~Prolog. It can be seen as an extension of Prolog able to deal with similarity-based fuzzy unification (''Bousi'' is the Spanish acronym ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Jan., 1988
128 pages
Copyright © 1988 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 03 January 1988
Published in SIGPLAN Volume 23, Issue 1
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 229Total Downloads
- Downloads (Last 12 months)43
- Downloads (Last 6 weeks)4
Reflects downloads up to 11 Dec 2024
Other Metrics
Citations
Cited By
View all- Lamma EMello PRossi G(2018)Parametric composable modules in a logic programming languageComputer Languages10.1016/0096-0551(93)90014-R18:2(105-123)Online publication date: 23-Dec-2018
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in