Towards a formal semantics for concurrent logic programming languages

  • Lennart Beckman
Session 3b: Theory And Semantics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 225)


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.


Logic Program Operational Semantic Formal Semantic Horn Clause Communicate Sequential Process 
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.

8. References

  1. [Be, 85]
    Beckman, L: Semantics for a Computational Model for Parallel Execution of Logic Programs, Upmail Technical Report 31Google Scholar
  2. [BeGuWæ, 86]
    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 1986Google Scholar
  3. [ClGr, 81]
    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 1981Google Scholar
  4. [Ho, 78]
    Hoare C A R: Communicating Sequential Processes, C ACM, vol 28, No 8 Google Scholar
  5. [Ll, 84]
    Lloyd, J W: Foundations of Logic Programming,Springer VerlagGoogle Scholar
  6. [Mi, 80]
    Milner R: A Calculus of Communicating Systems,LNCS Vol 92, Springer Verlag, 1980Google Scholar
  7. [Pe, 81]
    Peterson, J L: Petri Net Theory and the Modeling of Systems,Prentice-HallGoogle Scholar
  8. [Sa, 85]
    Saraswat, V: An operational semantics for CP[←, |, &], Report, DCS Carnegie-Mellon University, 1985Google Scholar
  9. [Ue, 85]
    Ueda, K: Concurrent Prolog Re-Examined,ICOT Technical Report TR-102Google Scholar
  10. [Ue, 85:2]
    Ueda, K: Guarded Horn Clauses,ICOT Technical Report TR-103Google Scholar
  11. [Sh, 83]
    Shapiro, E: A Subset of Concurrent Prolog and its Interpreter,ICOT Technical Report, TR-003Google Scholar
  12. [Wæ, 85]
    Wærn, A: A Computational Model for Parallel Execution of Horn Clause Programs,To appear as a Upmail Student ReportGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Lennart Beckman
    • 1
  1. 1.Upmail, Uppsala UniversityUppsalaSweden

Personalised recommendations