In this paper, we propose a rule language for designing interactive component languages and basic coordination languages. In our language, concurrent rules manage interactions and applications of call-back functions on a store of data that can freely be structured as an array, a list, a set of communication channels, etc. This rule language is a kind of an abstract machine to write interactive component languages. We then propose a specific component language to write solver cooperation languages. We illustrate the use of this language to specify and implement a cooperation language for constraint solving.