Parallel programming through schemes.
Taking as a basis the underlying model of Ada language, but using a more syncretic notation, the main purpose of the present paper is to show how, given a problem in parallel programming, several solutions to it can be found systematically by direct or compound instantiation of two well characterized basic schemes which correspond to the general and somewhat dual situations of cooperation and competition.