Resource Aware ML, Version 1.4.2, July 2018

Typechecking module ...
  Typecheck successful.
  Stack-based typecheck successful.

Analyzing function cons ...

  Trying degree: 1

== cons :

  ['a; 'a list] -> 'a list

  Non-zero annotations of the argument:
      4.00  <--  (*, [])

  Non-zero annotations of result:

  Simplified bound:
     4.00
--
  Mode:          upper
  Metric:        steps
  Degree:        1
  Run time:      0.01 seconds
  #Constraints:  7

====

Analyzing function dfsAcc ...

  Trying degree: 1

== dfsAcc :

  [['a; 'b] -> 'b; 'a tree; 'b] -> 'b

  Non-zero annotations of the argument:
     17.00  <--  (*, [Node(*)], *)
      6.00  <--  (*, [], *)

  Non-zero annotations of result:

  Simplified bound:
     6.00 + 17.00*M
   where
     M is the number of Node-nodes of the 2nd component of the argument

--
  Mode:          upper
  Metric:        steps
  Degree:        1
  Run time:      0.01 seconds
  #Constraints:  37

====

Analyzing function revApp ...

  Trying degree: 1

== revApp :

  ['a list; 'a list] -> 'a list

  Non-zero annotations of the argument:
      9.00  <--  ([Cons(*)], [])
      3.00  <--  ([], [])

  Non-zero annotations of result:

  Simplified bound:
     3.00 + 9.00*M
   where
     M is the number of Cons-nodes of the 1st component of the argument

--
  Mode:          upper
  Metric:        steps
  Degree:        1
  Run time:      0.01 seconds
  #Constraints:  33

====

Analyzing function flatten ...

  Trying degree: 1

== flatten :

  'a tree -> 'a list

  Non-zero annotations of the argument:
     30.00  <--  [Node(*)]
     30.00  <--  []

  Non-zero annotations of result:

  Simplified bound:
     30.00 + 30.00*M
   where
     M is the number of Node-nodes of the argument

--
  Mode:          upper
  Metric:        steps
  Degree:        1
  Run time:      0.02 seconds
  #Constraints:  92

====