YES 0.395 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/FiniteMap.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:



↳ HASKELL
  ↳ BR

mainModule FiniteMap
  ((emptyFM :: FiniteMap b a) :: FiniteMap b a)

module FiniteMap where
  import qualified Maybe
import qualified Prelude
  data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) 
  emptyFM :: FiniteMap b a
emptyFM = EmptyFM


module Maybe where
  import qualified FiniteMap
import qualified Prelude


Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL
  ↳ BR
    ↳ HASKELL
      ↳ COR

mainModule FiniteMap
  ((emptyFM :: FiniteMap a b) :: FiniteMap a b)

module FiniteMap where
  import qualified Maybe
import qualified Prelude
  data FiniteMap a b = EmptyFM  | Branch a b Int (FiniteMap a b) (FiniteMap a b) 
  emptyFM :: FiniteMap b a
emptyFM = EmptyFM


module Maybe where
  import qualified FiniteMap
import qualified Prelude


Cond Reductions:
The following Function with conditions
undefined 
 | False
 = undefined

is transformed to
undefined  = undefined1

undefined0 True = undefined

undefined1  = undefined0 False



↳ HASKELL
  ↳ BR
    ↳ HASKELL
      ↳ COR
        ↳ HASKELL
          ↳ Narrow

mainModule FiniteMap
  (emptyFM :: FiniteMap b a)

module FiniteMap where
  import qualified Maybe
import qualified Prelude
  data FiniteMap b a = EmptyFM  | Branch b a Int (FiniteMap b a) (FiniteMap b a) 
  emptyFM :: FiniteMap b a
emptyFM = EmptyFM


module Maybe where
  import qualified FiniteMap
import qualified Prelude


Haskell To QDPs