A sequential implementation of Parlog

  • Ian Foster
  • Steve Gregory
  • Graem Ringwood
  • Ken Satoh
Session 2a: Implementations And Architectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 225)


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.


Parent Process Runnable Process Code Pointer Candidate Clause Guard Horn Clause 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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.Google Scholar
  2. 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.Google Scholar
  3. Clark, K.L., and Gregory, S. [1985]. Notes on the implementation of PARLOG. In Journal of Logic Programming 2, 1 (April), pp 17–42.Google Scholar
  4. Clark, K.L., and Gregory, S. [1986]. PARLOG: parallel programming in logic. In ACM Transactions on Programming Languages and Systems 8, 1 (January).Google Scholar
  5. Foster, I.T. [1986]. Compiling PARLOG for the SPM. Research report, Department of Computing, Imperial College, London.Google Scholar
  6. Furukawa, K., Kunifuji, S., Takeuchi, A., and Ueda, K. [1984]. The conceptual specification of Kernel Language version 1. Technical report TR-054, ICOT, Tokyo.Google Scholar
  7. 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.Google Scholar
  8. Gregory, S. [1986]. The Sequential PARLOG Machine. Research report (in preparation), Department of Computing, Imperial College, London.Google Scholar
  9. 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.Google Scholar
  10. Kusalik, A.J. [1985]. Semantic issues with Concurrent Prolog. Presentation at Imperial College, London, May.Google Scholar
  11. 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.Google Scholar
  12. 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.Google Scholar
  13. Saraswat, V.A. [1985]. Problems with Concurrent Prolog. Technical report, Department of Computer Science, Carnegie-Mellon University, June.Google Scholar
  14. Shapiro, E.Y. [1983]. A subset of Concurrent Prolog and its interpreter. Technical report TR-003, ICOT, Tokyo, February.Google Scholar
  15. Ueda, K. [1985a]. Guarded Horn Clauses. Technical report TR-103, ICOT, Tokyo, September.Google Scholar
  16. Ueda, K. [1985b]. Concurrent Prolog re-examined. Technical report TR-102, ICOT, Tokyo, November.Google Scholar
  17. Warren, D.H.D. [1983]. An abstract Prolog instruction set. Technical note 309, SRI International, Menlo Park, CA, October.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Ian Foster
    • 1
  • Steve Gregory
    • 1
  • Graem Ringwood
    • 1
  • Ken Satoh
    • 2
  1. 1.Department of ComputingImperial CollegeLondonEngland
  2. 2.AI Laboratory Fujitsu Laboratories Ltd.KawasakiJapan

Personalised recommendations