Using complexity functions to generate normal forms for free algebra terms. - Alex Pelin (ACM Conference on Computer Science, 1984)

Solving Word Problems in Free Algebras Using Complexity Functions. - Alex Pelin; Jean H. Gallier (CADE, 1984)

A Formalism for Treating Equivalence of Recursive Procedures. - Alex Pelin (RAIRO Theor. Informatics Appl., 1985)

Exact Computation Sequences. - Alex Pelin; Jean H. Gallier (CAAP, 1986)

Computing with Conditional Rewrite Rules. - Alex Pelin (CTRS, 1987)

Building Exact Computation Sequences. - Alex Pelin; Jean H. Gallier (Theor. Comput. Sci., 1987)