Abstract
Pei was introduced to express and transform parallel programs. In this paper, we recall its main features and focus on the notion of data field in the language. We define the type of such objects and present an algorithm to infer types.
Chapter PDF
Keywords
References
Luca Cardelli. Basic polymorphic typechecking. Science of Computer Programming, 8:2, April 1987. AT&T Bell Laboratories.
M. Chen, Y. Choo, and J. Li. Parallel Functional Languages and Compilers. Frontier Series. ACM Press, 1991. Chapter 7.
Stéphane Genaud, Eric Violard, and Guy-René Perrin. Transformations techniques in Pei. EUROPAR'95, LNCS, 966:131–142, August 1995.
P. Hammarlund and B. Lisper. On the relation between functional and data parallel programming languages. FPCA93, ACM Press, pages 210–222, 1993.
Wayne Kelly, Vadim Maslov, William Pugh, Evan Rosser, Tatiana Shpeisman, and David Wonnacott. The Omega Library — Version 1.00, April 1996. Interface Guide.
L. Lamport. The parallel execution of DO loops. Communications of the ACM, 17(2):83–93, February 1974.
C. Lengauer. Loop parallelization in the polytope model. Parallel Processing Letters, 4(3), 1994.
C. Mauras. Alpha: un langage équationnel pour la conception et la programmation d'architectures parallèles synchrones. PhD thesis, U. Rennes, 1989.
C. Mongenet, P. Clauss, and G.-R. Perrin. Geometrical tools to map systems of affine recurrence equations on regular arrays. Acta Informatica, 31:137–160, 1994.
C. Morgan. Programming from specifications. C.A.R. Home. Prentice Hall Ed., Endlewood Cliffs, N.J., 1990.
William Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, August 1992.
P. Quinton and V. Van Dongen. The mapping of linear recurrence equations on regular arrays. Journal of VLSI Signal Processing, 1, 1989.
R.D. Tennent. Semantics of Programming Languages. C.A.R. Hoare. Prentice Hall Ed., Endlewood Cliffs, N.J., 1991.
E. Violard and G.-R. Perrin. Pei: a language and its refinement calculus for parallel programming. Parallel Computing, 18:1167–1184, 1992.
E. Violard and G.-R. Perrin. Pei: a single unifying model to design parallel programs. PARLE'93, LNCS, 694:500–516, June 1993.
Eric Violard, Stéphane Genaud, and Guy-René Perrin. Refinement of data parallel programs in Pei. IFIP TC2 Workshop on Algorithmic Languages and Calculi, Chapman & Hall, February 1997.
Pierre Weis and Xavier Leroy. Le langage Caml. Interéditions — iia, 1993. *** DIRECT SUPPORT *** A0008C42 00018
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Violard, E. (1997). Typechecking of Pei expressions. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002778
Download citation
DOI: https://doi.org/10.1007/BFb0002778
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive