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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.-R. Abrial. Formal Methods for Industrial Applications, volume 1165 of LNCS, chapter Steam-Boiler Control Specification Problem, pages 500–510. Springer, 1996.
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.
J. C. M. Baeten and W. P. Weijland. Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.
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.
A. Brogi and P. Ciancarini. The concurrent language, Shared Prolog. ACM TOPLAS, 13(1):99–123, January 1991.
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.
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.
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.
P. Codognet and F. Rossi. Nmcc programming: Constraint enforcement and retraction in cc programming. In Proc. of ICLP’ 95. MIT Press, 1995.
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.
P. Deransart, A. Ed-Dbali, and L. Cervoni. Prolog: The Standard, Reference Manual. Springer, 1996.
R. Echahed and W. Serwe. A multiparadigm programming scheme. Technical Report, forthcoming.
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.
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.
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.
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.
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.
D. Miller. Forum: A multiple-conclusion specification logic. Theoretical Computer Science, 165(1):201–232, September 1996.
R. Milner. A calculus of communicating systems, volume 92 of LNCS. Springer, 1980.
R. Milner, J. G. Parrow, and D. J. Walker. A calculus of mobile processes. Information and Computation, 100(1):1–77, September 1992.
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.
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.
J. H. Reppy. Concurrent Programming in ML. Cambridge University Press, 1999.
V. A. Saraswat. Concurrent Constraint Programming. ACM Doctoral Dissertation Awards. MIT Press, 1993.
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.
V. A. Saraswat and P. Lincoln. Higher-order, linear, concurrent constraint programming. Technical report, Xerox PARC, 1992.
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.).
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.
P. Wadler. How to declare an imperative. ACM Computing Surveys, 29(3):240–263, September 1997.
P. Wegner. Interactive foundations of computing. Theoretical Computer Science, 192(2):315–351, February 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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