Logic programming with focusing proofs in linear logic

Journal of Logic and Computation

Volumn 2, Issue 3, 1992, Pages 297-347

  Andreoli, Jean Marc ^a  

^a E C R C GmbH Arabellastr ^*  (Germany)

Author keywords

Concurrency.; Linear logic; Logic programming; Parallelism; Proof normalization; Sequent systems

Indexed keywords

EID: 0000421604     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/2.3.297     Document Type: Article

References (31)

1. S. Abramsky (1990). Computational interpretations of linear logic. Technical report, DOC, Imperial College, London, UK.
2. G. Agha and C. Hewitt (1987). Actors: a conceptual foundation for concurrent object-oriented programming. In B. Shriver and P. Wegner (eds) Research Directions in Object-Oriented Programming. MIT Press, Cambridge, MA.
3. J.M. Andreoli (1990). Proposition pour une synthèse des paradigmes de la programmation logique et de la programmation par objects. Thèse d’informatique de l’Université de Paris 6, Paris, France.
4. J.M. Andreoli and R. Pareschi (1990). LO and behold concurrent structured processes. In Proceedings of OOPSLAIECOOP’90, Ottawa, Canada.
5. J.M. Andreoli and R. Pareschi (1990). Logic programming with sequent systems: a linear logic approach. In Proceedings of the Workshop on Extensions of Logic Programming, Tübingen, Germany. Lecture Notes in Artificial Intelligence 475. Springer Verlag, Berlin.
6. J.M. Andreoli and R. Pareschi (1991). Communication as fair distribution of knowledge. In Proceedings of OOPSLA’91, Phoenix, USA.
7. J.M. Andreoli and R. Pareschi (1991). Linear Objects: Logical processes with built-in inheritance. New Generation computing, 9(34), 445-473.
8. J.M. Andreoli and R. Pareschi (1991). Dynamic programming as multi-agent programming. In Proceedings of the ECOOP’91 Workshop on Object-based Concurrent Computing, Genève, Switzerland. Lecture Notes in Computer Science, Springer Verlag, Berlin.
9. J. P. Banâtre, A. Coûtant, and D. Le Metayer (1988). A parallel machine for multiset transformation and its programming style. Future Generation Computer Systems, 4(2), 133-145.
10. G. Berry and G. Boudol (1990). The chemical abstract machine. In Proceedings of the 17th ACM Symposium on Principles of Programming Languages, San Francisco, USA.
11. A. Brogi and P. Ciancarini (1991). The concurrent language Shared Prolog. ACM Transactions on Programming Languages and Systems, 13(1), 99-123.
12. C. Brown (1989). Relating petri nets to formulae of linear logic. Technical report, University of Edinburgh, Edinburgh, UK.
13. K. Clark and S. Gregory (1986). Parlog: Parallel programming in logic. ACM Transactions on Programming Languages and Systems, 8(1), 1-50.
14. J. S. Conery (1988). Logical objects. In Proceedings of the 5th International Conference on Logic Programming, Seattle, USA.
15. T. Conlon (1989). Programming in Parlog. Addison Wesley.
16. J. Gallier (1986). Logic for Computer Science. Harper & Row, New York.
17. D. Gelernter (1985). Generative communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1), 80-113.
18. J.Y. Girard (1987). Linear logic. Theoretical Computer Science, 50, 1-102.
19. J.Y. Girard (1991). On the unity of logic. Preprint, Université de Paris 7.
20. J.Y. Girard, Y. Lafont, and P. Taylor (1989). Proofs and Types. Cambridge University Press, Cambridge, UK.
21. J. S. Hodas and D. Miller (1992). Logic programming in a fragment of intuitionistic linear logic. Journal of Information and Computation. To appear.
22. Y. Lafont (1990). Interaction nets. In Proceedings of 17th ACM Symposium on Principles of Programming Languages, San Francisco, USA.
23. N. Marti-Olliet and J. Meseguer (1989). From petri-nets to linear logic. Technical report, SRI International, Menlo Park, USA.
24. A. Matsuoka and S. Kawai (1988). Using tuple space communication in distributed object oriented languages. In Proceedings of OOPSLA’88, San Diego, USA.
25. J. Meseguer (1990). Rewriting as a unified model of concurrency. Technical report, SRI International, Menlo Park, USA.
26. D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov (1991). Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51, 125-157.
27. L. Monteiro and A. Porto (1989). Contextual logic programming. In Proceedings of the 6th International Logic Programming Conference, Lisboa, Portugal.
28. H. Penny Nii (1989). Blackboard systems. In A. Barr, Cohen P., and Feigenbaum E. (eds) The Handbook of Artificial Intelligence. Vol. 4, pp. 1-82, Addison Wesley.
29. E. Shapiro (1989). The family of concurrent logic programming languages. Technical report, The Weizmann Institute of Science, Rehovot, Israel.
30. E. Shapiro and A. Takeuchi (1983). Object oriented programming in concurrent prolog. New Generation Computing, 1(1), 25-48.
31. K. Ueda (1986). Guarded Horn Clauses. PhD thesis, Dept of Information Engineering, University of Tokyo, Tokyo, Japan.