On parallel programming methodology in GHC

Experience in programming a proof procedure of temporal logic
  • Kazuko Takahashi
  • Tadashi Kanamori
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 264)


Parallel programming methodology in GHC is discussed based on our experience in programming a proof procedure of temporal logic. It is said that GHC can express basic constructs of parallel processing such as communication and synchronization very simply, but we have not yet had enough experiences with parallel programming in GHC. By programming a proof procedure of temporal logic in Prolog and GHC, we compare the thinking style in sequential programming and that in parallel programming. Parallel programming methodology is discussed based on the experience.


Temporal Logic Shared Variable Node Process Disjunctive Normal Form Thinking Style 
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 and Gregory 84]
    Clark,K.L. and S.Gregory, “PARLOG: Parallel Programming in Logic,” Research Report DOC 81/16,Imperial College of Science and Technology,1984.Google Scholar
  2. [Fusaoka and Takahashi 85]
    Fusaoka,A. and K.Takahashi, “On QFTL and the Refutation Procedure on ω-graphs,” pp.43–54,TGAL85-31,IECE,Japan,1985.Google Scholar
  3. [Hughes and Cresswell 68]
    [Hughes and Cresswell 68] Hughes,G.E. and Cresswell,M.J., “An Introduction to Modal Logic,” Methuen and Co. Ltd, 1968.Google Scholar
  4. [Kusalik 84]
    Kusalik, A.J., “Bounded-Wait Merge in Shapiro's Concurrent Prolog,” New Generation Computing, pp.157–169,Vol.2,No.2,1984.Google Scholar
  5. [Kripke 69]
    Kripke,S.A., “A Completeness Theorem in Modal Logic,” The Journal of Symbolic Logic,Vol.24, No.1,March 1969.Google Scholar
  6. [Manna and Pnueli 81]
    Manna,Z. and A.Pnueli, “Verification of Concurrent Programs, Part1: The Temporal Framework,” Stanford TR 81-836,1981.Google Scholar
  7. [Miyazaki 85]
    Miyazaki,T., “Guarded Horn Clause Compiler User's Guide,” unpublished, 1985.Google Scholar
  8. [Shapiro 83]
    Shapiro,E.Y., “A Subset of Concurrent Prolog and Its Interpreter,” ICOT TR-003,1983.Google Scholar
  9. [Shapiro 84]
    Shapiro,E.Y., “Systems Programming in Concurrent Prolog,” Proc.11th Annual ACM Symposium on Principles of Programming Languages, pp.93–105,1984.Google Scholar
  10. [Takahashi and Kanamori 86]
    Takahashi,K. and T.Kanamori, “On Parallel Programming Methodology in GHC,” ICOT TR-184,1986.Google Scholar
  11. [Takeuchi 86]
    “Algorithmic Debugging of GHC Programs and Its Implementation in GHC,” ICOT TR-185,1986.Google Scholar
  12. [Ueda 85]
    Ueda,K., “Guarded Horn Clauses,” ICOT TR-103,1985.Google Scholar
  13. [Wolper 81]
    Wolper,P.L., “Temporal Logic Can Be More Expressive,” Proc.22nd IEEE Symposium on Foundation of Computer Science, pp.340–348,1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Kazuko Takahashi
    • 1
  • Tadashi Kanamori
    • 1
  1. 1.Central Research LaboratoryMitsubishi Electric CorporationJapan

Personalised recommendations