We consider universal computability of the STRS with no additional rule schemes:

  Signature: uncurry :: (a -> b -> c) -> a -> b -> c

  Rules: uncurry(F, Y, U) -> F(Y, U)

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

We start by computing the initial DP problem D1 = (P1, R UNION R_?, i, c), where:

  P1 [empty set of DPs]

***** We apply the Graph Processor on D1 = (P1, R UNION R_?, i, c).

We compute a graph approximation with the following edges:


As there are no SCCs, this DP problem is removed.

Processor output: { }.