Abstract
The programming of parallel systems requires a much higher level of abstraction than is provided by traditional programming languages and programming techniques. Therefore we aim at an approach that utilizes the clarity and power of mathematical concepts to the highest possible extent. In this paper we investigate, how a combination of higher-order functions with particular data structure specifications can be used for the programming of parallel algorithms.
This work was partially sponsored by the “Bundesministerium für Forschung und Technologie (BMFT)” as part of the project “KORSO — Korrekte Software” and by the CEC as part of the Esprit Basic Research Working Group 6112 “Compass”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. S. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, volume 36 of NATO ASI, F, pages 5–42. Springer Verlag, 1987.
R. S. Bird. Lectures on constructive functional programming. In M. Broy, editor, Constructive Methods in Computing Science, volume 55 of NATO ASI, F, pages 151–216. Springer Verlag, 1988.
M. Barr and C. Wells. Category Theory for Computing Science. Prentice Hall, 1990.
M. Cole. Algorithmic Skeletons: Structured Management of Parallel Computation. MIT Press, 1989.
J. Darlington, A. J. Field, P. G. Harrison et al. Parallel programming using skeleton functions. Personal Communication. Presented at PARLE '93.
A. S. Grimshaw. Easy-to-use object-oriented parallel processing with Mentat. IEEE Computer, 26(5):39–51, May 1993.
P. Pepper. Deductive derivation of parallel programs. In R. Paige, J. Reif, and R. Wachter, editors, Parallel Algorithm Derivation and Program Transformation. Kluwer Academic Publishers, 1993. To appear. Also: Technical Report 92-23, Technische Universität Berlin, July 1992.
P. Pepper and B. Möller. Programming with (finite) mappings. In M. Broy, editor, Informatik und Mathematik, pages 381–405. Springer Verlag, 1991.
D. B. Skillicorn. The Bird-Meertens formalism as a parallel model. Presented at: NATO ARW Software for Parallel Computation, Cosenza, Italy, June 1992, 1992.
Y. V. Srinivas. A sheaf-theoretic approach to pattern matching and related problems. Technical report, Kestrel Institute, 1991.
F. W. von Henke. On generating programs from types: An approach to automatic programming. In G. Huet and G. Kahn (eds.) Construction, Amélioration et Vérification des Programmes, 57–69. Colloques IRIA, 1975.
J. A. Yang and Y. il Choo. Formal derivation of an efficient parallel 2-d gauss-seidel method. In Proceedings of the 6th International Processing Symposium, pages 204–207. IEEE Computer Society Press, March 1992.
Young-il Choo. Data fields as parallel programs. Talk at TU Berlin, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pepper, P., Exner, J., Südholt, M. (1993). Functional development of massively parallel programs. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Formal Methods in Programming and Their Applications. Lecture Notes in Computer Science, vol 735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039710
Download citation
DOI: https://doi.org/10.1007/BFb0039710
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57316-6
Online ISBN: 978-3-540-48056-3
eBook Packages: Springer Book Archive