Advertisement

Deriving a compilation method for parallel logic languages

  • Youji Kohda
  • Jiro Tanaka
Programming Languages And Implementation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 315)

Abstract

It is already known that a Concurrent Prolog program can be compiled into an equivalent Prolog program. Using a Concurrent Prolog interpreter written in Prolog, we converted Concurrent Prolog programs step by step to compiled codes in Prolog. Each conversion step was successfully executed on a Prolog language processor. We examined how each conversion step contributed to performance improvement, using sample Concurrent Prolog programs such as a meta interpreter.

Keywords

Schedule Strategy Horn Clause Prolog Program Conversion Step Candidate 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Hirsch, M., Silverman, W. and Shapiro, E., Layers of Protection and Control in the Logix System, CS86-19, Weizmann Instit., 1986Google Scholar
  2. [2]
    Kursawe, P., How to Invent a Prolog Machine, in Proc. of 3rd Inter. Conf. on Logic Prog., 1986, pp. 134–148Google Scholar
  3. [3]
    Shapiro, E., A Subset of Concurrent Prolog and Its Interpreter, Tech. rep. TR-003, ICOT, 1983Google Scholar
  4. [4]
    Ueda, K., and Chikayama, T., Concurrent Prolog Compiler on Top of Prolog, in Proc. of Symp. on Logic Prog., 1985, pp. 119–126Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Youji Kohda
    • 1
  • Jiro Tanaka
    • 2
  1. 1.International Institute for Advanced Study of Social Information ScienceFujitsu LimitedTokyoJAPAN
  2. 2.Institute for New Generation Computer TechnologyTokyoJapan

Personalised recommendations