1. Adding algebraic rewriting to the calculus of constructions: strong normalization preserved, Extended Abstracts;Barbanera,1990
2. Conditional rewrite rules: confluence and termination;Bergstra;J. Comput. System Sci.,1986
3. Unification in a combination of equational theories: an efficient algorithm;Boudet,1990
4. Combining algebra and higher-order types;Breazu-Tannen,1988
5. Polymorphic rewriting conserves algebraic strong normalization;Breazu-Tannen;Theoret. Comput. Sci.,1989