Skip to main content

PARLOG: The language and its applications

  • Conference paper
  • First Online:
PARLE Parallel Architectures and Languages Europe (PARLE 1987)

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

Abstract

The key concepts of the parallel logic programming language PARLOG are introduced by comparing the language with Prolog. Some familiarity with Prolog and the concept of logic programming is assumed. Two major application areas of PARLOG, systems programming and object oriented programming are illustrated. Other applications are briefly surveyed. Some comparison is made between PARLOG and the related parallel logic languages Concurrent Prolog and GHC.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Broda, K. and Gregory, S. 1984. PARLOG for discrete event simulation. In Proceedings of the 2nd International Conference on Logic Programming (Uppsala, July), S.-A. Tarnlund (Ed.), Uppsala, pp.301–312.

    Google Scholar 

  • Clark, K.L. and Foster, I.T. 1987. A declarative environment for concurrent logic programming, to appear in Proceedings of Tapsoft 87 Conference (Pisa, Italy).

    Google Scholar 

  • Clark, K.L. and Gregory, S. 1981. A relational language for parallel programming. In Proceedings of ACM Conference on Functional Languages and Computer Architecture (Portsmouth, New Hampshire), Arvind and J. Dennis (Eds.), 171–178.

    Google Scholar 

  • Clark, K.L. and Gregory, S. 1984a. PARLOG: parallel programming in logic. Research Report DOC 84/4, Dept. of Computing, Imperial College, London. Also in ACM Transactions on Programming Languages and Systems, 8(1), pp. 1–49.

    Google Scholar 

  • Clark, K.L. and Gregory, S. 1984b. Notes on systems programming in PARLOG. In Proceedings of International Conference on Fifth Generation Computer Systems (Tokyo), H. Aiso (Ed.), Elsevier/North Holland, pp 299–306.

    Google Scholar 

  • Clark, K.L. and Gregory, S. 1985. Notes on the implementation of PARLOG. Journal of Logic Programming, 2(1), pp 17–42.

    Article  Google Scholar 

  • Davison, A. 1987. Objects and Meta Objects in PARLOG, Research Report, PARLOG Research Group, Dept. of Computing, Imperial College, London.

    Google Scholar 

  • Darlington, J. and Reeve, M. J. 1981. ALICE: a multiprocessor reduction machine. In Proceedings of ACM Conference on Functional Languages and Computer Architecture (Portsmouth, New Hampshire), Arvind and J. Dennis (Eds.)

    Google Scholar 

  • Dijkstra, E. W. 1976. A Discipline of Programming. Prentice-Hall.

    Google Scholar 

  • Elshiewy, N. A. 1987, Extended PARLOG: Logic Programming of Real Time Systems, Research Report, Computer Science Lab, Ericsson Telecom, Sweden.

    Google Scholar 

  • Foster, I.T., 1986. The PARLOG programming system: Reference Manual, PARLOG Research Group, Dept. of Computing, Imperial College, London.

    Google Scholar 

  • Foster, I.T., 1987. A meta interpreter in PARLOG for PARLOG with a meta call. Research Note, PARLOG Research Group, Dept. of Computing, Imperial College, London.

    Google Scholar 

  • Foster, I.T., Gregory, S., Ringwood, G.A. and Satoh, K. 1986. A sequential implementation of PARLOG. In Proceedings of 3rd International Logic Programming Conference (London), Springer-Verlag, pp 149–156.

    Google Scholar 

  • Gilbert, D., 1987a. Executable LOTOS: using PARLOG to implement an FDT, to appear in Proceedings of Protocol Specification, Testing and verification VII (Zurich).

    Google Scholar 

  • Gilbert, D., 1987b. Implementing LOTOS in PARLOG, Research Report, PARLOG Research Group, Dept. of Computing, Imperial College, London.

    Google Scholar 

  • Gregory, S. 1987. Parallel Logic Programming in PARLOG. Addison-Wesley.

    Google Scholar 

  • Gregory, S., Foster, I., Burt, A. D., Ringwood, G. A., 1987. An Abstract Machine for the Implementation of PARLOG on Uniprocessors. Research Report, PARLOG Research Group, Dept. of Computing, Imperial College, London.

    Google Scholar 

  • Gregory, S., Neely, R. and Ringwood, G.A. 1985. PARLOG for specification, verification and simulation. In Proceedings of the 7th International Symposium on Computer Hardware Description Languages and their Applications (Tokyo, August), C.J. Koomen and T. Moto-oka (Eds.), Elsevier/North-Holland, pp. 139–148.

    Google Scholar 

  • Hoare, C. A. R. 1978. Communicating sequential processes. CACM,17(10), pp 666–677.

    Google Scholar 

  • Huntbach, M. H. 1987. Algorithmic PARLOG Debugging. Research Report, PARLOG Research Group, Dept. of Computing, Imperial College, London.

    Google Scholar 

  • Kahn, K., Tribble, E. D., Miller, M.S., Bobrow, D. G., 1986. Objects in Concurrent Logic Languages, in Proceedings of OOPSLA '86 (Portland, Oregon), ACM.

    Google Scholar 

  • Lam, M. and Gregory, G., 1987. PARLOG and ALICE: a Marriage of Convenience, to appear in Proceedings of 4th International Logic programming Conference (Melbourne), MIT Press.

    Google Scholar 

  • Pereira, F. C. N. and Warren, D. H. D. 1980. Definite clause grammars for language analysis — a survey of the formalism and a comparison with augmented transition networks, Artificial Intelligence 13, pp 231–278.

    Article  Google Scholar 

  • Ringwood, G. A. 1987. PARLOG86 and the Dining Logicians, Research Report, PARLOG Research Group, Dept. of Computing, Imperial College, London. To appear in CACM.

    Google Scholar 

  • Shapiro, E. Y. 1983. A subset of Concurrent Prolog and its interpreter. Tecnical Report TR-003, ICOT, Tokyo.

    Google Scholar 

  • Shapiro, E. Y. and Mierowsky, C. 1984. Fair, biased, and self balancing merge operators. In Proceedings of IEEE Symposium on Logic Programming (Atlantic City, New Jersey), IEEE Computer Press, pp 83–90.

    Google Scholar 

  • Shapiro, E. Y. and Takeuchi, A. 1983. Object oriented programming in Concurrent Prolog. In New Generation Computing 1, pp 25–48.

    Google Scholar 

  • Takeuchi, A. and Furakawa, K. 1985. Bounded Buffer Communication in Concurrent Prolog. New Generation Computing 3(2), pp 145–155.

    Google Scholar 

  • Ueda, K. 1985. Guarded Horn Clauses. ICOT Teonical Report TR-103, ICOT, Tokyo.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. W. de Bakker A. J. Nijman P. C. Treleaven

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Clark, K.L. (1987). PARLOG: The language and its applications. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds) PARLE Parallel Architectures and Languages Europe. PARLE 1987. Lecture Notes in Computer Science, vol 259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17945-3_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-17945-3_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17945-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics