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 comp ...

  Trying degree: 1

== comp :

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

  Non-zero annotations of the argument:
      5.00  <--  (*, *, *)

  Non-zero annotations of result:

  Simplified bound:
     5.00
--
  Mode:          upper
  Metric:        steps
  Degree:        1
  Run time:      0.00 seconds
  #Constraints:  12

====

Analyzing function walk ...

  Trying degree: 1

== walk :

  'a tree -> 'a list -> 'a list

  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 argument

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

====

Analyzing function flatten ...

  Trying degree: 1, 2, 3

  A bound for flatten could not be derived. The linear program is infeasible.

--
  Mode:          upper
  Metric:        steps
  Degree:        3
  Run time:      0.11 seconds
  #Constraints:  672

====