We consider the system 472.

  Alphabet:

    f : [o -> o] --> o 
    g : [o] --> o 
    h : [] --> o 
    i : [o] --> o 

  Rules:

    f(/\x.X(x)) => g(X(h)) 
    g(X) => i(X) 

We use rule removal, following [Kop12, Theorem 2.23].

This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]):

  f(/\x.X(x)) >? g(X(h)) 
  g(X) >? i(X) 

We use a recursive path ordering as defined in [Kop12, Chapter 5].

Argument functions:

  [[h]] = _|_ 
  [[i(x_1)]] = x_1 

We choose Lex = {} and Mul = {f, g}, and the following precedence: f > g

Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows:

  f(/\x.X(x)) >= g(X(_|_)) 
  g(X) > X 

With these choices, we have:

  1] f(/\x.X(x)) >= g(X(_|_))  because [2], by (Star) 
  2] f*(/\x.X(x)) >= g(X(_|_))  because f > g and [3], by (Copy) 
  3] f*(/\x.X(x)) >= X(_|_)  because [4], by (Select) 
  4] X(f*(/\x.X(x))) >= X(_|_)  because [5], by (Meta) 
  5] f*(/\x.X(x)) >= _|_  by (Bot) 

  6] g(X) > X  because [7], by definition 
  7] g*(X) >= X  because [8], by (Select) 
  8] X >= X  by (Meta) 

We can thus remove the following rules:

  g(X) => i(X) 

We use rule removal, following [Kop12, Theorem 2.23].

This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]):

  f(/\x.X(x)) >? g(X(h)) 

We use a recursive path ordering as defined in [Kop12, Chapter 5].

Argument functions:

  [[h]] = _|_ 

We choose Lex = {} and Mul = {f, g}, and the following precedence: f > g

Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows:

  f(/\x.X(x)) > g(X(_|_)) 

With these choices, we have:

  1] f(/\x.X(x)) > g(X(_|_))  because [2], by definition 
  2] f*(/\x.X(x)) >= g(X(_|_))  because f > g and [3], by (Copy) 
  3] f*(/\x.X(x)) >= X(_|_)  because [4], by (Select) 
  4] X(f*(/\x.X(x))) >= X(_|_)  because [5], by (Meta) 
  5] f*(/\x.X(x)) >= _|_  by (Bot) 

We can thus remove the following rules:

  f(/\x.X(x)) => g(X(h)) 

All rules were succesfully removed.  Thus, termination of the original system has been reduced to termination of the beta-rule, which is well-known to hold.


+++ Citations +++

[Kop12]  C. Kop.  Higher Order Termination.  PhD Thesis, 2012.