The system is accessible function passing by a sort ordering that equates all sorts.

We start by computing the following initial DP problem:

  P1. (1) f#(0) => 0#
      (2) f#(0) => f#(0)
      (3) map#(Z, cons(U, V)) => map#(Z, V)
      (4) filter#(J, cons(X1, Y1)) => filter2#(J(X1), J, X1, Y1)
      (5) filter2#(true, G1, V1, W1) => filter#(G1, W1)
      (6) filter2#(false, J1, X2, Y2) => filter#(J1, Y2)

***** We apply the Graph Processor on P1.

Considering the 3 SCCs, this DP problem is split into the following new problems.

  P2. (1) f#(0) => f#(0)

  P3. (1) map#(Z, cons(U, V)) => map#(Z, V)

  P4. (1) filter#(J, cons(X1, Y1)) => filter2#(J(X1), J, X1, Y1)
      (2) filter2#(true, G1, V1, W1) => filter#(G1, W1)
      (3) filter2#(false, J1, X2, Y2) => filter#(J1, Y2)

***** No progress could be made on DP problem P2.