Résumé
This article describes the relational programming paradigm. Because a function is a particular case of relation, we can consider the computation of points-to-set processes (relations) instead of points-to-point processes (functions). Relations are useful for parallel, non-deterministic or multi-valued algorithms. The first section presents the main features of the proposed language and it is shown how relations make programs more flexible and natural. Then, we present an efficient implementation of the language on a classical architecture.