Abstract
We address the correctness problem of parallel implementation of functional programs. Those functional programs are evaluated by a set of concurrent agents communicating with each other and cooperating together while the computations progress. New communications among agents are introduced to improve the performance, because properties or facts about functions to be computed are exploited. In particular we show that those communications may avoid redundant computations of intermediate results. We provide the logical theories for proving correctness of implementation of functional programs together with facts about those programs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Backus, “Can Programming be Liberated from the von-Neumann Style? A Functional Style and Its Algebra of Programs”, J.A.C.M. Vol. 21, No.8 (1978) pp. 613–641.
R.M. Burstall, J. Darlington, “A transformation system for developing recursive programs”, J.A.C.M. Vol. 24, No. 1 (1977) pp. 44–67.
R.M. Burstall, D.B. MacQueen, D.T. Sannella, “HOPE: An Experimental Applicative Language”, Proc. LISP Conf. Standord University (1980).
J. Darlington, M. Reeve, “Alice: A Multiprocessor Reduction Machine for Parallel Evaluation of Applicative Languages”, Proc. ACM/MIT Conference on Functional Programming Languages and Computer Architecture (1981).
L. Kott, “About transformation system: A theoretical study”, 3ème Colloque International sur la Programmation, Dunod, Paris (1978).
A. Pettorossi, A. Skowron, “Theories for Verifying Communicating Agents Behaviour in Recursive Equations Programs”, Proc. 20-th Annual Conf. on Information Sciences and Systems, Princeton (1986).
A. Pettorossi, A. Skowron, “Using Facts for Improving the Parallel Execution of Functional Programs”, Proc. 15-th Conf. on Parallel Processing, St. Charles, Illinois (1986).
A. Pettorossi, A. Skowron, “Factual Knowledge for Developing Concurrent Programs”, Proc. AAAI-86, Philadelphia (1986).
S. Radev, “Infinitary Modal Logic and Programming Languages”, Ph. D. Thesis, Warsaw University 1980.
W.L. Scherlis, “Expression Procedures and Program Derivation”, Ph.D. Thesis, Stanford Univ. Computer Science Report STAN-CS-80-818 (1980).
D.A. Turner, “Functional Programs as Executable Specifications” in “Mathematical Logic and Programming Languages” C.A.R. Hoare, J.C. Shepherdson eds., Prentice Hall (1984).
N. Wirth, “Program Development by Stepwise Refinement”, C.A.C.M. Vol. 14 (1971) pp. 221–227.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Plenum Press, New York
About this chapter
Cite this chapter
Pettorossi, A., Skowron, A. (1987). The Parallel Evaluation of Functional Programs. In: Skordev, D.G. (eds) Mathematical Logic and Its Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0897-3_10
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0897-3_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8234-1
Online ISBN: 978-1-4613-0897-3
eBook Packages: Springer Book Archive