Logical semantics of concurrent constraint programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1118, Issue , 1996, Pages 397-409

  Ruet, Paul ^a,b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b Thales Research K Technology Domaine de Corbeville   (France)

Author keywords

Concurrent constraint programming; Intuitionistic logic; Linear logic

Indexed keywords

EID: 84957875628     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61551-2_89     Document Type: Conference Paper

References (25)

1. M. Abrusci. Phase semantics and sequent calculus for pure non-commutative classical linear logic. Journal of Symbolic Logic, 56(4), 1991.
2. J.M. Andreoli and R. Pareschi. Linear objects: logical processes with built-in inheritance. New Generation Computing, 9, 1991.
3. G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96, 1992.
4. E Best, F.S. de Boer, and C. Palamidessi. Concurrent constraant programming with information retrieval. Esprit project ACCLAIM final report, 1994.
5. G. Boudol. Asynchrony and the π-calculus. Techmcal Report RR 1702, INRIA, 1992.
6. F. Fages. Constructive negation by pruning. To appear in J. of Logic Programming, 1996.
7. F.S. de Boer, M. Gabbrielli, E. Marchiori, and C. Palamidessi. Proving concurrent constraint programs correct. In Proceedings of the ACM International Conference on Principles of Programming Languages, 1994.
8. J.Y. Girard. Linear logic. Theoretical Computer Science, 50, 1987.
9. J. Jaffar and J-L. Lassez. Constraint logic programming. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages, Munich, Germany, pages 111-119. ACM, January 1987.
10. R. Jagadeesan, V. Shanbhogue, and V.A. Saraswat. Angelic non-determinism in concurrent constraint programming. Technical report, Xerox Pare, 1991.
11. N. Kobayashi and A. Yonezawa. Logical, testing and observation equivalence for processes in a linear logic programming. Technical Report 93-4, Department of Computer Science, University of Tokyo, 1993.
12. K. Kunen. Negation in logic programming. Journal of Logic Programming, 4(3):289-308, 1987.
13. P. Lincoln and V.A. Saraswat. Proofs as concurrent processes. Manuscript, 1992.
14. M.J. Maher. Logic semantics for a class of committed-choice programs. In Proceedings of ICLP'87, International Conference on Logic Programming, 1987.
15. D. Miller. The x-calculus as a theory in linear logic: preliminary results. In Proceedings Workshop on Extensions of Logic Programming, Springer LNCS 660, 1992.
16. R. Milner. The polyadic π-calculus. Technical Report ECS-LFCS-91-180, Edinburgh University, 1991.
17. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1), 1992.
18. G. Perrier. Concurrent programming in linear logic. Technical Report CRIN 95-R-052, INRIA-Lorraine, 1995.
19. A. Podelski and G. Smolka. Operational semantics of constraint logic programming with coroutining. In Proceedings of ICLP'95, International Conference on Logic Programming, Tokyo, 1995.
20. Ch. Retoré. Réseaux et sequents ordonnes. PhD thesis, Université Paris 7, 1993.
21. V.A. Saraswat. Concurrent constraint programming. ACM Doctoral Dissertation Awards. MIT Press, 1993.
22. V.A. Saraswat and P. Lincoln. Higher-order linear concurrent constraint programming. Manuscript, 1992.
23. V.A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In POPL'91: Proceedings 18th ACM Symposium on Principles of Programming Languages, 1991.
24. P.J. Stuckey. Constructive negation for constraint logic programming. Information and Computation, 118(1), 1995.
25. C. Tse. The design and implementation of an actor language based on linear logic Master Thesis, MIT, 1994.