Skip to main content
SpringerLink
Log in

Parallel logic programming using the Linda model of computation

  • Conference paper
  • First Online:
Reasearch Directions in High-Level Parallel Programming Languages (HLPPP 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 574))

Abstract

In this paper we study the relationship between Linda programming and parallel logic programming. We define PoliSpaces (PoliS) as an extension of Linda with Multiple Tuple Spaces. PoliS is introduced as a framework for designing multiparadigm systems, i.e., systems where code written in different languages can coexist. Our first test for PoliS is logic programming. We describe syntax and semantics of PoliS Prolog, a new parallel logic language based on PoliS. A parallel semantics for PoliS Prolog is given defining a multilevel abstract machine based on a chemical interpretation of the basic logic programming execution mechanism. The multilevel abstract machine is the basis for an implementation where the key idea consists of introducing a meta tuple space as a communication kernel across different tuple spaces.

This work is partially supported by a N.A.T.O. grant, and by C.N.R. Progetto Finalizzato Sistemi Paralleli, and M.U.R.S.T.

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. V. Ambriola, P. Ciancarini, and C. Montangero. Enacting Software Processes in Oikos. In Proceedings of ACM SIGSOFT Conf. on Software Development Environments, volume 15:6 of ACM SIGSOFT Software Engineering Notes, pages 12–23, 1990.

    Google Scholar 

  2. J.-M. Andreoli and R. Pareschi. Linear Objects: Logical Processes with Built-in Inheritance. In Proc. 7 th Int. Conf. on Logic Programming, Jerusalem, May 1990. MIT Press.

    Google Scholar 

  3. J.-P. Banatre and D. LeMetayer. The GAMMA model and its Discipline of Programming. Science of Computer Programming, 15:55–77, 1990.

    Google Scholar 

  4. G. Berry and G. Boudol. The chemical abstract machine. In Proc. 17 th ACM Conf. on Principles of Programming Languages, pages 81–94, 1990.

    Google Scholar 

  5. A. Brogi and P. Ciancarini. The concurrent language Shared Prolog. ACM Transactions on Programming Languages and Systems, 13(1):99–123, 1991.

    Google Scholar 

  6. N. Carriero and D. Gelernter. Coordination languages and their significance. Communications of the ACM, 1991, to appear.

    Google Scholar 

  7. P. Ciancarini and D. Yankelewich. Inside Linda. Technical Report RR YALEU/DCS/RR-831, Yale University, Dept. of Computer Science, October 1990.

    Google Scholar 

  8. H. C. Cunningham and G.-C. Roman. A Unity-Style Programming Logic for Shared Dataspace Programs. IEEE Transactions on Parallel and Distributed Systems, 1(3):365–376, July 1990.

    Google Scholar 

  9. I. Foster and S. Taylor. Strand: New Concepts in Parallel Programming. Prentice Hall, 1990.

    Google Scholar 

  10. D. Gelernter. A Note on Systems Programming in Concurrent Prolog. In Proc. Int. Symp. Logic Programming, February 1984.

    Google Scholar 

  11. D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, 1985.

    Google Scholar 

  12. D. Gelernter. Multiple tuple spaces in Linda. In Proceedings of PARLE '89, volume 365 of Lecture Notes in Computer Science, pages 20–27, 1989.

    Google Scholar 

  13. J. Y. Girard. Linear Logic. Theoretical Computer Science, 50:1–102, 1987.

    Article  Google Scholar 

  14. G. Kahn and D. MacQueen. Coroutines and Networks of Parallel Processes. In B. Gilchrist, editor, Information Processing 77: Proc. IFIP Congress, pages 993–998. North Holland, 1977.

    Google Scholar 

  15. E. Lusk, D. Warren, and alii. The Aurora OR-parallel Prolog System. In Proc. Int. Conf. on 5th Generation Computer Systems, pages 819–830. ICOT, 1988.

    Google Scholar 

  16. L. Pereira and R. Nasr. Deltaprolog: A distributed logic programming language. In Proc. of the Int. Conf. on Fifth Generation Computer Systems, pages 283–291, 1984.

    Google Scholar 

  17. V. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie Mellon University, 1989. (To be published by MIT Press).

    Google Scholar 

  18. V. Saraswat, K. Kahn, and J. Levy. Janus: A step towards distributed constraint programming. In North American Conference on Logic Programming, 1990.

    Google Scholar 

  19. E. Y. Shapiro. Embedding Linda and other joys of concurrent logic programming. Communications of the ACM, 33(10):1240–1258, October 1989.

    Google Scholar 

  20. E. Y. Shapiro. The family of concurrent logic languages. ACM Computing Surveys, 21(3), September 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Pisa, Italy

    Paolo Ciancarini

  2. Yale University, New Haven, Connecticut

    Paolo Ciancarini

Authors
  1. Paolo Ciancarini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean Pierre Banâtre Daniel Le Métayer

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciancarini, P. (1992). Parallel logic programming using the Linda model of computation. In: Banâtre, J., Le Métayer, D. (eds) Reasearch Directions in High-Level Parallel Programming Languages. HLPPP 1991. Lecture Notes in Computer Science, vol 574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55160-3_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-55160-3_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46762-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation