Skip to main content
SpringerLink
Log in

Towards a formal semantics for concurrent logic programming languages

  • Session 3b: Theory And Semantics
  • Conference paper
  • First Online:
Third International Conference on Logic Programming (ICLP 1986)

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

Included in the following conference series:

  • 130 Accesses

Abstract

A method for giving a formal semantics of concurrent logic programming languages is proposed. It is shown how the semantics can be defined in terms of a concurrent execution model, based on Milner's CCS (Calculus of Communicating Systems). The method is illustrated by describing the main features of Relational Language, Concurrent Prolog and Guarded Horn Clauses.

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.

8. References

  1. Beckman, L: Semantics for a Computational Model for Parallel Execution of Logic Programs, Upmail Technical Report 31

    Google Scholar 

  2. Beckman L, Gustavsson R, Wærn A: An Algebraic Model of Parallel Execution of Logic Programs, In Proceedings of the Symposium of Logics in Computer Science, Cambridge, June 1986

    Google Scholar 

  3. Clark K L, Gregory S: A Relational Language for Parallel Programming, In Proceedings of the ACM conference on Functional Programming Languages and Computer Architecture, Oct 1981

    Google Scholar 

  4. Hoare C A R: Communicating Sequential Processes, C ACM, vol 28, No 8

    Google Scholar 

  5. Lloyd, J W: Foundations of Logic Programming,Springer Verlag

    Google Scholar 

  6. Milner R: A Calculus of Communicating Systems,LNCS Vol 92, Springer Verlag, 1980

    Google Scholar 

  7. Peterson, J L: Petri Net Theory and the Modeling of Systems,Prentice-Hall

    Google Scholar 

  8. Saraswat, V: An operational semantics for CP[←, |, &], Report, DCS Carnegie-Mellon University, 1985

    Google Scholar 

  9. Ueda, K: Concurrent Prolog Re-Examined,ICOT Technical Report TR-102

    Google Scholar 

  10. Ueda, K: Guarded Horn Clauses,ICOT Technical Report TR-103

    Google Scholar 

  11. Shapiro, E: A Subset of Concurrent Prolog and its Interpreter,ICOT Technical Report, TR-003

    Google Scholar 

  12. Wærn, A: A Computational Model for Parallel Execution of Horn Clause Programs,To appear as a Upmail Student Report

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Upmail, Uppsala University, P.O. Box 2059, S-750 02, Uppsala, Sweden

    Lennart Beckman

Authors
  1. Lennart Beckman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ehud Shapiro

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beckman, L. (1986). Towards a formal semantics for concurrent logic programming languages. In: Shapiro, E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16492-8_86

Download citation

  • DOI: https://doi.org/10.1007/3-540-16492-8_86

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39831-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation