References

1.

Bellia M. and M.E. Occhiuto, ``Lazy linear combinatorial unification'', J. Symbolic Computation 27, (1999),pp. 185-206.

2.

Bellia M. and M.E. Occhiuto, ``Another PRAM algorithm for finding connected components of sparse graphs'', submitted for publication,(1998).

3.

Bellia M. and M.E. Occhiuto, ``Bounds in Parallel Unification'', submitted for publication,(1999a).

4.

Bellia M. and M.E. Occhiuto, ``Algorithms for Parallel Unification'', in preparation (1999b).

5.

Bellia M. and M.E. Occhiuto, ``Suprema of open and closed formulas and their application to resolution'', Information and Computation 117,1 (1995), pp. 136-150.

6.

Broda S and Damos L., ``Compact bracket in combinatory logic'', Journal of Symbolic Logic, 62, 3, (1997), pp. 729-740.

7.

Broome P. and Lipton J., ``Combinatory logic programming: Computing in realtion calculi'', International Logic Programming Symp., (1994).

8.

Dwork, P.C. Kanellakis, J.C. Mitchell, ``On the sequential nature of unification'', J. Logic Programming, 1, (1984), 35-50.

9.

Hughes J., ``Supercombinators a: a new implementation method for applicative languages'', ACM Symposium on Lisp and Functional Programming, (1982).

10.

Kanellakis P.C., P.S. Revesz,On Relationship of Congruence Closure and Unification,J. of Symbolic Computation, 7,3-4, 1989, 427-44.

11.

Scholz E., ``Imperative streams - a monadic combinator library for syncronous programming'', SIGPLAN - Notices 34,1, (1999).

12.

Tarski A. and Givant S., ``A formalization of set theory without variables'', Coll. Publication, 41, American Mathematical Society, (1987).