Cyclic terms unification `X=f(f(X), X), Y=f(Y, f(Y)), X = Y. `

[j4n_bur53]

@kuniaki.mukai

I don’t know about deutsch
time(minimum_coa([X,Y],[I,J], M)),
%@ % 59,153 inferences, 0.003 CPU in 0.004 seconds

For deutsch/2 see Donald Knuth:

Donald E. Knuth, The Art of Computer Programming
Addison-Wesley, volumes 1 and 2, 2nd edition, 1997.

As it happens he first introduces infinite trees:

And then he goes to garbage collection: