Parallel ReDuX -> PaReDuX

[1]  Wolfgang Küchlin,et al.  The S-Threads Environment for Parallel Symbolic Computation , 1990, CAP.

[2]  Hoon Hong,et al.  The Design of the SACLIB/PACLIB Kernels , 1993, DISCO.

[3]  A. R. Turquette,et al.  Logic, Semantics, Metamathematics , 1957 .

[4]  Wolfgang Küchlin,et al.  Experiments with Virtual C Threads , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[5]  Jim Christian,et al.  Fast Knuth-Bendix Completion: Summary , 1989, International Conference on Rewriting Techniques and Applications.

[6]  Jean Della Dora,et al.  Computer Algebra and Parallelism , 1989, Lecture Notes in Computer Science.

[7]  Jörg Denzinger,et al.  Distributing Equational Theorem Proving , 1993, RTA.

[8]  Carl H. Hauser,et al.  The portable common runtime approach to interoperability , 1989, SOSP '89.

[9]  Reinhard Bündgen,et al.  Reduce the Redex -> ReDuX , 1993, RTA.

[10]  Wolfgang Küchlin,et al.  A fine-grained parallel completion procedure , 1994, ISSAC '94.