Skip to main content
SpringerLink
Log in

Committed-choice concurrent logic programming in linear logic

  • Contributed Papers
  • Conference paper
  • First Online:
Computational Logic and Proof Theory (KGC 1993)

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

Included in the following conference series:

Abstract

The paper deals with the relationship of committed-choice logic programming languages and their proof-theoretic semantics based on linear logic. Fragments of linear logic are used in order to express various aspects of guarded clause concurrent programming and behavior of the system. The outlined translation comprises structural properties of concurrent computations, providing a sound and complete model wrt. to the interleaving operational semantics based on transformation systems. In the presence of variables, just asynchronous properties are captured without resorting to special proof-generating strategies, so the model is only correct for deadlock-free programs.

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. Andreoll, J.-M., Pareschi, R.: Logic programming with sequent systems. A linear logic approach. in: Extensions of Logic programming, Schroeder-Heister, P., ed., LNAI 475, Springer, Berlin, 1991.

    Google Scholar 

  2. Clark, K. L., Gregory, S.: PARLOG: Parallel programming in logic, ACM TOPLAS 8(1), 1986, 1–49.

    Google Scholar 

  3. Girard, J.-Y.: Linear logic, Theoretical Computer Science, 50(1), 1987.

    Google Scholar 

  4. Girard, J.-Y.: Linear logic: A survey. Logic, Algebra and Computation, Marktoberdorf Summer School, 1991.

    Google Scholar 

  5. Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types, Cambridge University Press, Cambridge, 1989.

    Google Scholar 

  6. Gregory, S.: Parallel Logic Programming in PARLOG: The Language and its implementation. Addison-Wesley, Reading, MA, 1987.

    Google Scholar 

  7. Huet, G.: A uniform approach to type theory, in: Logical Foundations of Functional programming, Addison-Wesley, Reading, MA, 1990, 337–397.

    Google Scholar 

  8. Lafont, Y.: The linear abstract machine, Theoretical Computer Science, 59, 1988.

    Google Scholar 

  9. Martí-Oliet, N., Meseguer, J.: From Petri nets to linear logic, in: Category Theory and Computer Science, Pitt, D. H., et. al., ed., LNCS 389, Springer, 1989, 313–340.

    Google Scholar 

  10. Shapiro, E.(ed.): Concurrent Prolog: Collected Papers., Vols 1 & 2, MIT Press, 1987.

    Google Scholar 

  11. Shapiro, E.: The family of concurrent programming languages, ACM Computing Surveys, 1989, 413–510.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Masaryk University, Buresova 20, 602 00, Brno, Czech Republic

    Jiři Zlatuška

Authors
  1. Jiři Zlatuška
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Georg Gottlob Alexander Leitsch Daniele Mundici

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zlatuška, J. (1993). Committed-choice concurrent logic programming in linear logic. In: Gottlob, G., Leitsch, A., Mundici, D. (eds) Computational Logic and Proof Theory. KGC 1993. Lecture Notes in Computer Science, vol 713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022581

Download citation

  • DOI: https://doi.org/10.1007/BFb0022581

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57184-1

  • Online ISBN: 978-3-540-47943-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation