Skip to main content
SpringerLink
Log in

Implementation of full GHC by communicating processes

  • Guarded Horn Clauses
  • Conference paper
  • First Online:
Logic Programming '88 (LP 1988)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 383))

Included in the following conference series:

  • 130 Accesses

Abstract

In this paper an algorithm for interpreting the parallel logic language GHC (Guarded Horn Clauses) is described. The algorithm interprets full GHC programs using several communicating processes, which do not share data objects. To control unification and suspension, an integer (called commit value) is attached to each external references. An implementation of the algorithm on a concurrent lisp is also reported. This algorithm is applicable to conventional languages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Ueda: Guarded Horn Clauses, Logic Programming '85, E. Wada (ed.), Lecture Notes in Computer Science 221, Springer-verlag (1986).

    Google Scholar 

  2. H. Iwasaki: Programming and Implementation of a Multi-processing Lisp (in Japanese), Trans. IPS Japan, Vol. 28 No. 5 (1987).

    Google Scholar 

  3. H. Iwasaki: mUtilisp Manual, METR 88-11, Department of Mathematical Engeneering and Information Physics, Faculty of Engeneering, University of Tokyo (1988).

    Google Scholar 

  4. T. Miyazaki and K. Taki: Flat GHC Implementation on Multi-PSI (in Japanese), The Login Programming Conference '86 (1986).

    Google Scholar 

  5. K. Fujimura, M. Kurihara and I. Kaji: An Implementation of GHC compiler on the LISP Systems (in Japanese), Trans. IPS Japan, Vol. 28 No. 7 (1987).

    Google Scholar 

  6. T. Chikayama: Implementation of the Utilisp System (in Japanese), Trans. IPS Japan, Vol. 24 No. 5 (1983).

    Google Scholar 

  7. Y. Tada and M. Terada: Primitives for Testing Environment of Concurrent Processes (in Japanese), IPS Japan WGOS, No. 33–2 (1986).

    Google Scholar 

  8. M. Terada, H. Iwasaki, T. Tanaka, K. Konishi, K. Shirakawa and E. Wada: Implementation of GHC on the concurrent lisp (in Japanese), IPS Japan WGSYM, No. 44–3 (1988).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Engineering and Information Physics Faculty of Engineering, University of Tokyo, Japan

    Minoru Terada

Authors
  1. Minoru Terada
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Koichi Furukawa Hozumi Tanaka Tetsunosuke Fujisaki

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Terada, M. (1989). Implementation of full GHC by communicating processes. In: Furukawa, K., Tanaka, H., Fujisaki, T. (eds) Logic Programming '88. LP 1988. Lecture Notes in Computer Science, vol 383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51564-X_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-51564-X_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51564-7

  • Online ISBN: 978-3-540-46654-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation