Abstract
This paper develops a proof-theoretic semantics based on linear logic for Concurrent Prolog. Several fragments of linear logic are used in order to provide for a suitable translation of Concurrent Prolog clauses, with the committed-choice concurrency features captured by the properties of linear logic provability rather than by some additional mechanism and without the need of using the interleaving approach for defining concurrent behaviour. Linear logic operations from different fragments arise naturally from the need for specific features of the translation. It is demonstrated that the relationship between a logic programming language, such as Prolog, and a committed-choice concurrent logic one, such as Concurrent Prolog, can be understood as a change of the underlying logic inference, rather than by resorting to extra-logical machinery.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
J.-M. Andreoli and R. Pareschi: Logic programming with sequent systems. A linear logic approach. In: Extensions of Logic programming, P. Schroeder-Heister, ed., LNAI 475, Springer, Berlin, 1991.
J.-Y. Girard: Linear logic, Theoretical Computer Science, 50(1), 1987.
J.-Y. Girard: Linear logic: A survey. Logic, Algebra and Computation, Marktoberdorf Summer School, 1991.
J.-Y. Girard, Y. Lafont, and P. Taylor: Proofs and Types, Cambridge University Press, Cambridge, 1989.
S. Gregory: Parallel Logic Programming in PARLOG: The language and its implementation. Addison-Wesley, Reading, MA, 1987.
G. Huet: A uniform approach to type theory, in: Logical Foundations of Functional programming, Addison-Wesley, Reading, MA, 1990, 337–397.
J.W. Lloyd: Foundations of Logic Programming. Springer, Berlin, 1984.
R. Kowalski: Logic for Problem Solving. North-Holland, Amsterdam, 1979.
N. Martí-Oliet and J. Meseguer: From Petri nets to linear logic, in: Category Theory and Computer Science, D.H.Pitt, et.al., ed., LNCS 389, Springer, 1989, 313–340.
J. Messeguer: Rewriting as a unified model of concurrency, in: Proc. CONCUR'90, J.C.M.Baeten and J.W.Klop, eds., LNCS 458, Springer, 1990, 384–400.
E. Shapiro, (ed.): Concurrent Prolog: Collected Papers., Vols 1 & 2, MIT Press, 1987.
E. Shapiro: The family of concurrent programming languages, ACM Computing Surveys, 1989,413-510.
J. Zlatuška: Committed-choice logic programming in linear logic, in: Computational Logic and Proof Theory (Third Kurt Gödel Colloquium, KGC'93; G. Gottlob, A.Leitsch, and D.Mundici, eds.), LNCS 713, Springer, 1993, 337–348.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zlatuška, J. (1994). Linear logic semantics for Concurrent Prolog. In: Dyckhoff, R. (eds) Extensions of Logic Programming. ELP 1993. Lecture Notes in Computer Science, vol 798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58025-5_66
Download citation
DOI: https://doi.org/10.1007/3-540-58025-5_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58025-6
Online ISBN: 978-3-540-48417-2
eBook Packages: Springer Book Archive