Abstract
Two goals, simplicity of program designing, and efficiency of its computation, al- ways remain topical in programming, and more than anything this is true about parallel programming systems. The former goal is usually achieved for declar- ative programming languages, the latter - by embedding of coordination level operators. One of the earliest such extensions, future annotation, isa proposed in [3]. Their use allows to start a function computation before the moment when computation of its annotated arguments will be completed. Another advance to increase program parallelization was using of nondeterministic operators in pseudo-functional languages [5]. One more resource widely used in logic pro- gramming to program parallelization is speculative computation of alternative branches.
This work was supported by the Slovak Scientific Grant Agency within Research Project No.2/7186/20
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
B. Buchberger. An Algorithm for Finding a Basis for the Residue Class Ring of Zero-Dimensional Polynomial Ideal. Ph.D.Thesis, Math.Inst., Univ. of Innsbruck, Austria, 1965.
M. Cole. Algorithmic skeletons: structured Management of Parallel of Parallel Computation. MIT Press, Cambridge, Mass., 1989.
R. Halstead. Multilisp: A language for concurrent symbolic computation, ACM Transaction on Programming Languages and Systems, 7, 4 (1985), pp. 501–538
N.D. Jones, C.K. Gomard, and P. Sestoft, Partial Evaluation and Automatic Program Generation, Prentice Hall International, June 1993. xii + 415 pages.
Wolfgang Schreiner: A Para-Functional Programming Interface for a Parallel Computer Algebra Package, J. Symbolic Computation (1996), 21, No 4, pp. 593–614
H. Sondergard and P. Sestoft. Non-determinism in functional languages, The Computer Journal, 35(5): 514–523, 1992.
Trinder, P., Hammond, K., Loidl, H.-W., Peyton Jones, S. Algorithm + Strategy = Parallelism, Journal of Functional Programming, 8(1): 23–60, Jan. 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
Godlevsky, A.B., Hluchý, L. (2000). Executable Specification Language for Parallel Symbolic Computation. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_103
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_103
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive