Skip to main content
Conference ProceedingsOPEN ACCESS

Typechecking of PEI expressions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1300 LNCS 521-529
DOI: 10.1007/bfb0002778
3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Violard, E. (1997). Typechecking of PEI expressions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1300 LNCS, pp. 521–529). Springer Verlag. https://doi.org/10.1007/bfb0002778

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free