Skip to main content
SpringerLink
Log in

Combining Mobile Processes and Declarative Programming

  • Conference paper
  • First Online:
Computational Logic — CL 2000 (CL 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1861))

Included in the following conference series:

Abstract

We propose a general framework for combining mobile processes and declarative programming languages, e.g., functional, logic or functional-logic languages. In contrast to existing concurrent extensions of declarative languages, we distinguish clearly between the notion of processes and that of functions or predicates. Thus, our framework is generic and may be applied to extend several kinds of declarative languages. It also extends PA process algebra in order to deal with parameter passing, mobile processes and interactive declarative programming. In our setting, declarative programs are dynamic and may be modified thanks to the actions performed by processes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.-R. Abrial. Formal Methods for Industrial Applications, volume 1165 of LNCS, chapter Steam-Boiler Control Specification Problem, pages 500–510. Springer, 1996.

    MATH  Google Scholar 

  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.

    Article  Google Scholar 

  3. J. C. M. Baeten and W. P. Weijland. Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.

    Google Scholar 

  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étayer, editors, Proc. of the 2nd Int. Conf. on Coordination: Languages and Models (Coordination’ 97), volume 1282 of LNCS, pages 256–273, Berlin, September 1997. Springer.

    Google Scholar 

  5. A. Brogi and P. Ciancarini. The concurrent language, Shared Prolog. ACM TOPLAS, 13(1):99–123, January 1991.

    Google Scholar 

  6. S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(3):560–599, July 1984.

    Google Scholar 

  7. L. Caires and L. Monteiro. Verifiable and executable logic specifications of concurrent 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.

    Google Scholar 

  8. M. Carro and 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.

    Google Scholar 

  9. P. Codognet and F. Rossi. Nmcc programming: Constraint enforcement and retraction in cc programming. In Proc. of ICLP’ 95. MIT Press, 1995.

    Google Scholar 

  10. F. S. de Boer, J. N. Kok, C. Palamidessi, and J. J. M. M. Rutten. Non-monotonic concurrent constraint programming. In Proc. of the Int. Symp. on Logic Programming (ILPS’ 93), pages 315–334. The MIT Press, 1993.

    Google Scholar 

  11. P. Deransart, A. Ed-Dbali, and L. Cervoni. Prolog: The Standard, Reference Manual. Springer, 1996.

    Google Scholar 

  12. R. Echahed and W. Serwe. A multiparadigm programming scheme. Technical Report, forthcoming.

    Google Scholar 

  13. F. Fages, P. Ruet, and S. Soliman. Phase semantics and verification of concurrent constraint programs. In Proc. of the 13suth Annual IEEE Symp. on Logic in Computer Science (LICS’ 98), 1998.

    Google Scholar 

  14. C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In Proc. of the 23surd Symp. on Principles of Programming Languages (POPL’ 96), pages 372–385, St. Petersburg Beach, Florida, January 1996.

    Google Scholar 

  15. GUI Fest’ 95 Post-Challenge: multiple counters. available at http://www.cs.chalmers.se/~magnus/GuiFest-95/, July 24–July 28 1995. organized 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 Declarative Programming (PPDP’ 99), volume 1702 of LNCS, pages 188–205, Paris, 1999. Springer.

    Chapter  Google Scholar 

  17. S. Janson, J. Montelius, and S. Haridi. Ports for objects in concurrent logic programs. In Agha, Wegner, and Yonezawa, editors, Research Directions in Concurrent Object-Oriented Programming. The MIT Press, 1993.

    Google Scholar 

  18. D. Miller. Forum: A multiple-conclusion specification logic. Theoretical Computer Science, 165(1):201–232, September 1996.

    Google Scholar 

  19. R. Milner. A calculus of communicating systems, volume 92 of LNCS. Springer, 1980.

    MATH  Google Scholar 

  20. R. Milner, J. G. Parrow, and D. J. Walker. A calculus of mobile processes. Information and Computation, 100(1):1–77, September 1992.

    Google Scholar 

  21. S. L. Peyton Jones, A. D. Gorden, and S. Finne. Concurrent Haskell. In Proc. of the 23surd Symp. on Principles of Programming Languages (POPL’ 96), pages 295–308, St Petersburg Beach, Florida, January 1996.

    Google Scholar 

  22. B. C. Pierce and D. N. Turner. Pict: A programming language based on the picalculus. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 1998.

    Google Scholar 

  23. J. H. Reppy. Concurrent Programming in ML. Cambridge University Press, 1999.

    Google Scholar 

  24. V. A. Saraswat. Concurrent Constraint Programming. ACM Doctoral Dissertation Awards. MIT Press, 1993.

    Google Scholar 

  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.

    Google Scholar 

  26. V. A. Saraswat and P. Lincoln. Higher-order, linear, concurrent constraint programming. Technical report, Xerox PARC, 1992.

    Google Scholar 

  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.).

    Google Scholar 

  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.

    Google Scholar 

  29. P. Wadler. How to declare an imperative. ACM Computing Surveys, 29(3):240–263, September 1997.

    Google Scholar 

  30. P. Wegner. Interactive foundations of computing. Theoretical Computer Science, 192(2):315–351, February 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire LEIBNIZ, Institut IMAG, CNRS 46, avenue Felix Viallet, F-38031, Grenoble, France

    Rachid Echahed & Wendelin Serwe

Authors
  1. Rachid Echahed
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wendelin Serwe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Australian National University, Australia

    John Lloyd

  2. Simon Fraser University, Canada

    Veronica Dahl

  3. Universität Koblenz, Germany

    Ulrich Furbach

  4. The University of Birmingham, UK

    Manfred Kerber

  5. University of Manchester, UK

    Kung-Kiu Lau

  6. The Pennsylvania State University, USA

    Catuscia Palamidessi

  7. Universidade Nova de Lisboa, Portugal

    Luís Moniz Pereira

  8. The Hebrew University of Jerusalem, Israel

    Yehoshua Sagiv

  9. The University of Melbourne, Australia

    Peter J. Stuckey

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Echahed, R., Serwe, W. (2000). Combining Mobile Processes and Declarative Programming. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-44957-4_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67797-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation