Richard Statman The Word Problem for Smullyan's Lark Combinator is Decidable. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1989, v:7, n:2, pp:103-112 [Journal]
S. A. Vorontsov An Example of Application of Symbolic Computation in Solid State Physics. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1989, v:7, n:2, pp:179-181 [Journal]
Jerry F. Magnan A MACSYMA Program for the Multiple Bifurcation Analysis of Double-Diffusive Concection. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1989, v:7, n:2, pp:189-197 [Journal]