We present a system, PRISME, that computes programming strategies used in programs. These strategies are implementation techniques, such as traversals, accumulations or mappings. Combinations of strategies form algorithms.
PRISME formalizes the strategies and their organization in a signature which gives an abstract conceptual description of the program's underlying algorithm. Signatures represent a formal basis for the comprehension of the program's functionality.
In this paper, we present the model of signatures underlying PRISME, we describe how PRISME computes signatures and show how signatures are related to algorithms and functionnalities.
Ce papier est disponible en version Postcript ou sur demande à firstname.lastname@example.org .