H-Termination proof of ../tpdb/FP/full_haskell/Prelude_fromEnum

YES H-Termination proof of ../tpdb/FP/full_haskell/Prelude_fromEnum_7.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:

↳ HASKELL

  ↳ BR

mainModule Main

((fromEnum :: Bool -> Int) :: Bool -> Int)

module Main where

import qualified Prelude

Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ NumRed

mainModule Main

((fromEnum :: Bool -> Int) :: Bool -> Int)

module Main where

import qualified Prelude

Num Reduction:All numbers are transformed to thier corresponding representation with Succ, Pred and Zero.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ NumRed

        ↳ HASKELL

          ↳ Narrow

mainModule Main

(fromEnum :: Bool -> Int)

module Main where

import qualified Prelude

Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="fromEnum\n",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="fromEnum vx3\n",fontsize=16,color="burlywood",shape="triangle"];8[label="vx3/False",fontsize=10,color="white",style="solid",shape="box"];3 -> 8[label="",style="solid", color="burlywood", weight=9];
8 -> 4[label="",style="solid", color="burlywood", weight=3];
9[label="vx3/True",fontsize=10,color="white",style="solid",shape="box"];3 -> 9[label="",style="solid", color="burlywood", weight=9];
9 -> 5[label="",style="solid", color="burlywood", weight=3];
4[label="fromEnum False\n",fontsize=16,color="black",shape="box"];4 -> 6[label="",style="solid", color="black", weight=3];
5[label="fromEnum True\n",fontsize=16,color="black",shape="box"];5 -> 7[label="",style="solid", color="black", weight=3];
6[label="Pos Zero\n",fontsize=16,color="green",shape="box"];7[label="Pos (Succ Zero)\n",fontsize=16,color="green",shape="box"];}