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



↳ HASKELL
  ↳ BR

mainModule Queue
  ((emptyQueue :: Queue a) :: Queue a)

module Queue where
  import qualified Prelude
  data Queue a = Q [a] [a] [a] 
  emptyQueue :: Queue a
emptyQueue = Q [] [] []



Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL
  ↳ BR
    ↳ HASKELL
      ↳ COR

mainModule Queue
  ((emptyQueue :: Queue a) :: Queue a)

module Queue where
  import qualified Prelude
  data Queue a = Q [a] [a] [a] 
  emptyQueue :: Queue a
emptyQueue = Q [] [] []



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 Queue
  (emptyQueue :: Queue a)

module Queue where
  import qualified Prelude
  data Queue a = Q [a] [a] [a] 
  emptyQueue :: Queue a
emptyQueue = Q [] [] []



Haskell To QDPs