Combining mobile processes and declarative programming

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 300-314

  Echahed, Rachid ^a   Serwe, Wendelin ^a  

^a CNRS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

DECLARATIVE LANGUAGES; DECLARATIVE PROGRAMMING; DECLARATIVE PROGRAMMING LANGUAGE; DECLARATIVE PROGRAMS; FUNCTIONAL LOGIC LANGUAGES; MOBILE PROCESS; PROCESS ALGEBRAS;

ARTIFICIAL INTELLIGENCE;

LOGIC PROGRAMMING;

EID: 84867834994     PISSN: 03029743     EISSN: None     Source Type: Journal    
DOI: 10.1007/3-540-44957-4_20     Document Type: Article

References (30)

1. J.-R. Abrial. Formal Methods for Industrial Applications, volume 1165 of LNCS, chapter Steam-Boiler Control Speci-cation Problem, pages 500-510. Springer, 1996.
2. J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9(3-4):445-473, 1991. selected papers from the 7th Int. Conf. on Logic Programming, 1990.
3. J. C. M. Baeten and W. P. Weijland. Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.
4. E. Best, F. De Boer, and C. Palamidessi. Partial order and SOS semantics for linear constraint programs. In D. Garlan and D. L. M-etayer, editors, Proc. of the 2nd Int. Conf. on Coordination: Languages and Models (Coordination '97), volume 1282 of LNCS, pages 256-273, Berlin, Sept ember 1997. Springer.
5. A. Brogi and P. Ciancarini. The concurrent language, Shared Prolog. ACM TOPLAS, 13(1):99-123, January 1991.
6. S. D. Brookes, C. A. R. H oare, and A. W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(3):560-599, July 1984.
7. L. Caires and L. Monteiro. Veri-Able and executable logic speci-cations of con-current objects in L-. In C. Hankin, editor, Proc. of the 7th European Symp. on Programming (ESOP '98), volume 1381 of LNCS, pages 42-56, Lisbon, March-April 1998. Springer.
8. M. Carro, M. Hermenegildo Concurrency in prolog using threads and a shared database In Proc. of the 16th Int. Conf. on Logic Programming (ICLP '99), Las Cruces November 1999. MIT Press.
9. P. Codognet and F. Ros si. Nmcc programming: Constraint enforcement and re-traction in cc programming. In Proc. of ICLP '95. MIT Press, 1995.
10. F. S. De Boer, J. N. Kok, C. Palamidessi, and J. J. M. M. Rutten. No n-monotonic concurrent constraint programming. In Proc. of the Int. Symp. on Logic Program-ming (ILPS '93), pages 315-334. The MIT Press, 1993.
11. P. Deransart, A. Ed-Dbali, and L. Cervoni. Prolog: The Standard, Reference Man-ual. Springer, 1996.
12. R. Echahed and W. Serwe. A multiparadigm programming scheme. Technical Report, forthcoming.
13. F. Fages, P. Ruet, and S. Soliman. Phase semantics and verification of concur-rent constraint programs. In Proc. of the 13th Annual IEEE Symp. on Logic in Computer Science (LICS '98), 1998.
14. C. Fournet and G. Gonthier. The re flexive chemical abstract machine and the join-calculus. In Proc. of the 23rd Symp. on Principles of Programming Languages (POPL '96), pages 372-385, St. Petersburg Beach, Florida, January 1996.
15. GUI Fest '95 Post-Challenge: multiple counters. available at http://www.cs.chalmers.se/˜magnus/GuiFest-95/, July 24-July 28 1995. orga-nized by Simon Peyton Jones and Phil Gray as a part of the Glasgow Research Festival.
16. M. Hanus. Distributed programming in a multi-paradigm declarative language. In G. Nadathur, editor, Proc. of the Int. Conf. on Principles and Practice of Declara-tive Programming (PPDP '99), volume 1702 of LNCS, pages 188-205, Paris, 1999. Springer.
17. S. Janson, J. Montelius, and S. Haridi. Ports for objects in concurrent logic pro-grams. In Agha, Wegner, and Yonezawa, editors, Research Directions in Concur-rent Object-Oriented Programming. The MIT Press, 1993.
18. D. Miller. Forum: A multiple-conclusion speci-cation logic. Theoretical Computer Science, 165(1):201-232, September 1996.
19. R. Milner. A calculus of communicating systems, volume 92 of LNCS. Springer, 1980.
20. R. Milner, J. G. Parrow, and D. J. Walker. A calculus of mobile p rocesses. Infor-mation and Computation, 100(1):1-77, September 1992.
21. S. L. Peyton Jones, A. D. Gorden, and S. Finne. Concurrent Haskell. In Proc. of the 23rd Symp. on Principles of Programming Languages (POPL '96), pages 295-308, St Petersburg Beach, Florida, January 1996.
22. B. C. Pierce and D. N. Turner. Pict: A programming language based on the pi-calculus. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 1998.
23. J. H. Reppy. Concurrent Programming in ML. Cambridge University Press, 1999.
24. V. A. Saraswat. Concurrent Constraint Programming. ACM Doctoral Dissertation Awards. MIT Press, 1993.
25. V. A. Saraswat, R. Jagadeesan, and V. Gupta. Timed default concurrent constraint programming. Journal of Symbolic Computation, 22(5-6):475-520, November-December 1996.
26. V. A. Saraswat and P. Lincoln. Higher-order, linear, concurrent constraint pro-gramming. Technical report, Xerox PARC, 1992.
27. G. Smolka. Computer Science Today: Recent Trends and Developments, volume 1000 of LNCS, chapter The Oz Programming Model, pages 324-343. Springer, 1995. Jan van Leeuwen (Ed.
28. B. Thomsen, L. Leth, and T.-M. Kuo. FACILE | from toy to tool. In F. Nielson, editor, ML with Concurrency: Design, Analysis, Implementation and Application, Monographs in Computer Science, chapter 5, pages 97-144. Springer, 1996.
29. P.Wadler. How to declare an imperative. ACM Computing Surveys, 29(3):240-263, September 1997.
30. P. Wegner Interactive foundations of computing Theoretical Computer Science 192 2, 315-351, February, 1998