Président : Mariangiola DezaniRapporteurs : Gilles Dowek, Herman GeuversExaminateurs : Adam Cichon, Claude Kirchner, Luigi LiquoriThe rewriting calculus is a lambda-calculus with pattern matching. This thesis is devoted to the study of type systems for this calculus, and to its applications to the domain of deduction.We study two typing paradigms. The first one is inspired by the simply typed lambda-calculus, but it differs from it in the sense that a term may be well-typed without being terminating. Thus, we use it for representing programs and rewriting systems.The second family of type systems we study is adapted from the Pure Type Systems. We show its strong normalization via a translation into a typed lambda-calculus.Finally, we propos...