PEI
The PEI equational
language gives the programmer the ability to define relations between
variables called data fields, the whole set of equations being the program.
One set operator and three functions allow to write programs
in a data parallel way, and then transform the program through a
refinement process until a semantically equivalent version is acceptable
for execution on a parallel architecture.
The PEI theory has been initially designed by Dr E. Violard and Dr G.-R. Perrin and further work is carried out on the language by Dr S. Genaud, in the aera of programs conception and transformation.
PEI definition
- An HTML presentation of PEI, including definitions and examples, by J.-A. Gerber (french text). This document has been written in 1997.
Software
The language is now the base for practical implementations : some prototypes of software tools have been implemented :
- The PEI environment allows PEI programs type checking and definitions transforming.
- The VPEI environment allows to
build PEI programs in an interactive way through the use
of a graphical tool that generates PEI equations.
- Many PEI programs can be translated into functional or imperative programs.
We provide an on-line form, allowing to type in PEI programs and then to call the type-checker,
the translator to Caml programs, or the translator to High Performance Fortran.
A short tutorial is provided with the tools, showing some basic examples of Pei programs.
Translation and tutorial