Abstract
Applicative languages possess very attractive features with respect to program readability and correctness proofs. Sometimes, however, they do not seem to allow very high levels of efficiency. In this paper we consider how one can embed concepts of parallel evaluation and communications in applicative languages, so that program efficiency may be improved. We also studied a novel theory of communications among concurrent computing agents. In general, such communications are optional in the sense that only program efficiency (not program correctness) is effected, if they do not take place.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Burstall, R.M. and J. Darlington: A Transformation System for Developing Recursive Programs, J.A.C.M. Vol. 24, No. 1 (1977), pp. 44–67.
Burstall,R.M., D.B.MacQueen and D.T.Sannella: HOPE: An Experimental Applicative Language, Proc. LISP Conference. Stanford University (1980).
Dennis,J.B.: First Version of a Data Flow Procedure Language, L.N.C.S. 19 Springer Verlag (1974).
Hewitt, C. and H. Baker, Jr.: Actors and Continuous Functionals, in: Neuhold, E.J. (ed.), Formal Descriptions of Programming Languages, North Holland, Amsterdam (1978).
Kahn, G. and D.B. MacQueen: Coroutines and Network of Parallel Processes, in Gilchrist, B. (ed.), Information Processing 1977, North Holland, Amsterdam (1977), pp. 993–998.
McCarthy, J. et al.: LISP 1.5 Programmer's Manual, M.I.T. Press, MIT, Cambridge, Mass. (1962).
Milner,R.: A Calculus for Communicating Systems, L.N.C.S. n.92 Springer Verlag (1980).
Pettorossi,A.: Organizing Parallelism and Communications for Efficient Distributed Computations, Congress AICA Bologna (1980).
Pettorossi,A. and R.M.Burstall: Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique (submitted to Acta Informatica).
Roussel,P.: Prolog: Manual de reference et d'utilisation, Groupe d'Intelligence Artificielle, Marseille-Luminy (1975).
Schwartz,J.: Using Annotations to Make Recursion Equations Behave, D.A.I. Research Report No.43 D.A.I. University of Edinburgh (1977).
Ward, S.A. and R.H. Halstead, Jr.: A Syntactic Theory of Message Passing, J.A.C.M. Vol. 27 No. 2 (1980), pp. 365–383.
Warren,D.H.D., L.M.Pereira and F.Pereira: PROLOG-The language and its implementation compared with LISP, Proc. Symp. on Artificial Intelligence and Programming Languages SIGPLAN Notices, Vol. 12, No. 8 (1977).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pettorossi, A. (1981). An approach to communications and parallelism in applicative languages. In: Díaz, J., Ramos, I. (eds) Formalization of Programming Concepts. ICFPC 1981. Lecture Notes in Computer Science, vol 107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10699-5_117
Download citation
DOI: https://doi.org/10.1007/3-540-10699-5_117
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10699-9
Online ISBN: 978-3-540-38654-4
eBook Packages: Springer Book Archive