Abstract
In this paper, a message passing extension for Concurrent Clean is proposed which provides efficient and flexible communication. In contrast to other solutions in functional languages, we chose to have an asynchronous system. We discuss design decisions with respect to concurrent evaluation and communication of unique messages. Furthermore, we show some examples and implementation aspects.
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
P.M. Achten. Interactive Functional Programs-Models, Methods and Implementation. PhD thesis, University of Nijmegen, February 1996.
P.M. Achten and M.J. Plasmeijer. Interactive Functional Objects in Clean. In C. Clack, T. Davie, and K. Hammond, editors, Proc. 9th. International Workshop on Implementation of Functional Languages, St Andrews, Scotland, September 1997, volume 1467 of LNCS, pages 305–322. Springer-Verlag, 1998.
E. Barendsen and J.E.W. Smetsers. Uniqueness Type Inference. In M. Hermenegildo and D. Swierstra, editors, Proc. Programming Languages: Implementations, Logics and Programs (PLILP’95), volume 982 of LNCS, pages 189–207. Springer-Verlag, 1995.
K.P. Birman and R. van Renesse. Reliable Distributed Computing with the Isis Toolkit. IEEE Computer Society Press, Los Alamitos, CA, 1994.
Hoare C.A.R. Communicating Sequential Processes. Communications of the ACM, 21:666–671, Aug. 1978.
D. Dolev and D. Malki. The Transis Approach to High Availability Cluster Communication. Communications of the ACM, 39(4):64–70, April 1996.
I. Holyer and D. Carter. Deterministic Concurrency. In Proc. 1993 Glasgow Workshop on Functional Programming, pages 113–126. Springer-Verlag, July 1993.
M.P. Jones and P. Hudak. Implicit and Explicit Parallel Programming in Haskell. Technical Report YALEU/DCS/RR-982, Yale University, 1993.
M.H.G. Kesseler. Uniqueness and Lazy Graph Copying-Copyright for the Unique. In Proc. 6th. International Workshop on the Implementation of Functional Languages (IFL’94), Norwich, UK, 1994. University of East Anglia.
U. Klusik, Y. Ortega, and R. Peña. Implementing Eden, or Dreams Become Reality. In This Proceedings.
L.E. Moser, P.M. Melliar-Smith, D.A. Agarwal, Budhia R.K., and C.C. Lingley-Papadopoulos. Totem: A Fault-Tolerant Multicast Group Communication System. Communications of the ACM, 39(4):54–63, April 1996.
Gehani N.H. Broadcasting Sequential Processes (BSP). IEEE Transactions on Software Engineering, 10(4), July 1984.
E.G.J.M.H. Nöocker, J.E.W. Smetsers, M.C.J.D. van Eekelen, and M.J. Plasmeijer. Concurrent Clean. In Proc. PARLE’91 — Parallel Architectures and Languages Europe, volume 506 of LNCS, pages 202–219, Eindhoven, The Netherlands, June 1991. Spinger-Verlag.
S. Paul, Sabnani K.K, J.C. Lin, and S. Bhattacharyya. Reliable Multicast Transport Protocol (RMTP). IEEE Journal on Selected Areas in Communications, 15(3):407–421, April 1997.
S.L. Peyton Jones, A.D. Gordon, and S.O. Finne. Concurrent Haskell. In Proc. 23rd. ACM Symposium on Principles of Programming Languages (POPL’96), pages 295–308, St Petersburg Beach, Florida, January 1996. ACM Press.
M.R.C. Pil. First Class File I/O. In W. Kluge, editor, Proc. 8th. International Workshop on the Implementation of Functional Languages (IFL’96), Bad Godesberg, Germany, September 1996, volume 1268 of LNCS, pages 233–246. Springer-Verlag, 1997.
J. H. Reppy. Concurrent ML: Design, Application and Semantics. In P. E. Lauer, editor, Functional Programming, Concurrency, Simulation and Automated Reasoning, pages 165–198. Springer-Verlag, 1993.
E. Scholz. Four Concurrency Primitives for Haskell. In ACM/IFIP Haskell Workshop, La Jolla, Colifornia, 1995. Research Report YALEU/DCS/RR-1075.
B. Thomsen, L. Leth, S. Prasad, T-M. Kuo, A. Kramer, F. Knabe, and A. Giacalone. Facile Antigua Release Programming Guide. Technical Report ECRC-93-20, European Computer-Industry Research Centre, 1993.
D.N. Turner. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, Edinburgh University, 1995.
R. van Renesse, K.P. Birman, and S. Maffeis. Horus: A flexible Group Communications System. Communications of the ACM, 39(4), April 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Serrarens, P.R., Plasmeijer, R. (1999). Explicit Message Passing for Concurrent Clean. In: Hammond, K., Davie, T., Clack, C. (eds) Implementation of Functional Languages. IFL 1998. Lecture Notes in Computer Science, vol 1595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48515-5_15
Download citation
DOI: https://doi.org/10.1007/3-540-48515-5_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66229-7
Online ISBN: 978-3-540-48515-5
eBook Packages: Springer Book Archive