Abstract
The Sequential PARLOG Machine (SPM) is an abstract instruction set designed specifically for the efficient implementation of the parallel logic programming language PARLOG on sequential computers. This paper introduces a simple computational model for supporting PARLOG. The SPM embodies several refinements of this model that improve its performance in a sequential context; these are described, along with other key issues of the SPM system.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Clark, K.L., and Gregory, S. [1981]. A relational language for parallel programming. In Proceedings of the ACM Conference on Functional Programming Languages and Computer Architecture (Portsmouth, NH, October), Arvind and J. Dennis (Eds.), pp 171–178.
Clark, K.L., and Gregory, S. [1984]. Notes on systems programming in PARLOG. In Proceedings of the International Conference on Fifth Generation Computer Systems (Tokyo, November), H. Aiso (Ed.), Elsevier North-Holland, Amsterdam, pp 299–306.
Clark, K.L., and Gregory, S. [1985]. Notes on the implementation of PARLOG. In Journal of Logic Programming 2, 1 (April), pp 17–42.
Clark, K.L., and Gregory, S. [1986]. PARLOG: parallel programming in logic. In ACM Transactions on Programming Languages and Systems 8, 1 (January).
Foster, I.T. [1986]. Compiling PARLOG for the SPM. Research report, Department of Computing, Imperial College, London.
Furukawa, K., Kunifuji, S., Takeuchi, A., and Ueda, K. [1984]. The conceptual specification of Kernel Language version 1. Technical report TR-054, ICOT, Tokyo.
Gregory, S. [1985]. Design, application and implementation of a parallel logic programming language. PhD thesis, Department of Computing, Imperial College, London, September. To be published by Addison-Wesley.
Gregory, S. [1986]. The Sequential PARLOG Machine. Research report (in preparation), Department of Computing, Imperial College, London.
Ito, N., Kishi, M., Kuno, E., and Rokusawa, K. [1985]. The dataflow-based parallel inference machine to support two basic languages in KL1. Technical report, ICOT, Tokyo.
Kusalik, A.J. [1985]. Semantic issues with Concurrent Prolog. Presentation at Imperial College, London, May.
Mierowsky, C., Taylor, S., Shapiro, E., Levy, J., and Safra, M. [1985]. The Design and implementation of Flat Concurrent Prolog. Technical report CS85-09, Department of Applied Mathematics, Weizmann Institute of Science, Rehovot, July.
Miyazaki, T., Takeuchi, A., and Chikayama, T. [1985]. A sequential implementation of Concurrent Prolog based on the shallow binding scheme. In Proceedings of the IEEE Symposium on Logic Programming (Boston, MA, July), pp 110–118.
Saraswat, V.A. [1985]. Problems with Concurrent Prolog. Technical report, Department of Computer Science, Carnegie-Mellon University, June.
Shapiro, E.Y. [1983]. A subset of Concurrent Prolog and its interpreter. Technical report TR-003, ICOT, Tokyo, February.
Ueda, K. [1985a]. Guarded Horn Clauses. Technical report TR-103, ICOT, Tokyo, September.
Ueda, K. [1985b]. Concurrent Prolog re-examined. Technical report TR-102, ICOT, Tokyo, November.
Warren, D.H.D. [1983]. An abstract Prolog instruction set. Technical note 309, SRI International, Menlo Park, CA, October.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Foster, I., Gregory, S., Ringwood, G., Satoh, K. (1986). A sequential implementation of Parlog. In: Shapiro, E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16492-8_71
Download citation
DOI: https://doi.org/10.1007/3-540-16492-8_71
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16492-0
Online ISBN: 978-3-540-39831-8
eBook Packages: Springer Book Archive