Compiling Extended Concurrent Prolog -single queue compilation-

  • Jiro Tanaka
  • Makoto Kishishita
Logic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 213)


Extended Concurrent Prolog (ECP) [Fujitsu 85, Tanaka 85a] is an variant of Concurrent Prolog (CP) [Shapiro 83] with OR-parallel, set-abstraction and meta-inference features. In this paper, we describe the implementation of ECP “compiler” by showing how these extended features of ECP can be compiled to a Prolog program. Our ECP compiler has only one scheduling queue to which all the AND-related goals and all the OR-related clauses are enqueued. This scheduling method is designated “Single Queue Compilation.” This “Single Queue Compilation” makes it possible to handle all kinds of AND-relations and OR-relations in a uniform manner.


Logic Program Extended Feature Horn Clause Prolog Program Stream Form 
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.


  1. Clark K, Gregory S (1984) Notes on Systems Programming in Parlog. Proceedings of the International Conference on Fifth Generation Computer Systems 299–306Google Scholar
  2. Clark K, Gregory S (1985) PARLOG: Parallel Programming in Logic. Research Report DOC 84/4. Department of Computing, Imperial College of Science and Technology. Revised June 1985Google Scholar
  3. Fujitsu (1985) The Verifying Software of Kernel Language Version 1 — the Revised Detailed Specification and the Evaluation Result-, PART I. In: The 1984 Report on Committed Development on Computer Basic Technology, in JapaneseGoogle Scholar
  4. Furukawa K et al. (1984) The Conceptual Specification of the Kernel Language Version 1. Technical Report TR-054. ICOTGoogle Scholar
  5. Miyazaki T et al. (1985) A Sequential Implementation of Concurrnet Prolog Based on Shallow Binding Scheme. Proceedings of 1985 Symposium on Logic Programming 110–118Google Scholar
  6. Murakami K (1985) The study of “unifier” implementation in multi-processor environment. Multi-SIM study group internal document, ICOTGoogle Scholar
  7. Shapiro E (1983) A Subset of Concurrent Prolog and its Interpreter. Technical Report TR-003. ICOTGoogle Scholar
  8. Shapiro E et al. (1985) Logix User Manual for Release 1.1. Weizmann Institute, IsraelGoogle Scholar
  9. Tanaka J et al. (1984) A Sequential Implementation of Concurrent Prolog — based on the Lazy Copying Scheme. Proceedings of the First National Conference of Japan Society for Software Science and Technology 303–306, in JapaneseGoogle Scholar
  10. Tanaka J et al. (1985a) AND-OR Queuing in Extended Concurrent Prolog. Proceedings of the Logic Programming Conference '85 215–224, in Japanese. English version is to appear in Lecture Notes in Computer Science, SpringerGoogle Scholar
  11. Tanaka J et al. (1985b) Single Queue Compilation in Extended Concurrent Prolog. Mathematical Methods in Software Science and Engineering, RIMS Kokyuroku, Research Institute for Mathematical Science, Kyoto UniversityGoogle Scholar
  12. Tanaka J, Kishishita M. (1985c) Message Based Module Structure for Parallel Logic Languages. To appear in Proceedings of the Second National Conference of Japan Society for Software Science and Technology, in JapaneseGoogle Scholar
  13. Ueda K, Chikayama T (1985a) Concurrent Prolog Compiler on Top of Prolog. Proceedings of 1985 Symposium on Logic Programming 119–126Google Scholar
  14. Ueda K (1985b) Guarded Horn Clauses. Technical Report TR-103. ICOTGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Jiro Tanaka
    • 1
  • Makoto Kishishita
    • 2
  1. 1.ICOT, Mita-kokusai-building 21FTokyoJapan
  2. 2.International Institute for Advanced Study of Social Information Science (IIAS-SIS) Fujitsu LimitedTokyoJapan

Personalised recommendations