Using typed lambda calculus to implement formal systems on a machine Arnon AvronFurio HonsellRobert Pollack OriginalPaper Pages: 309 - 354
An extension of the Boyer-Moore Theorem Prover to support first-order quantification Matt Kaufmann OriginalPaper Pages: 355 - 372
On Fourier's algorithm for linear arithmetic constraints Jean-Louis LassezMichael J. Maher OriginalPaper Pages: 373 - 379
A note on the parallel complexity of anti-unification G. M. KuperK. W. McAloonK. J. Perry OriginalPaper Pages: 381 - 389
Efficient parallel term matching and anti-unification Arthur L. DelcherSimon Kasif OriginalPaper Pages: 391 - 406
The problem of demodulating across argument and literal boundaries Larry Wos Basic Research Problems Pages: 407 - 408