Resource Aware ML, Version 1.4.2, July 2018

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

Analyzing function fold ...

  Trying degree: 1

== fold :

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

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

  Non-zero annotations of result:

  Simplified bound:
     3.00 + 10.00*M
   where
     M is the number of Cons-nodes of the 3rd component of the argument

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

====

Analyzing function plus ...

  Trying degree: 1

== plus :

  [nat; nat] -> nat

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

  Non-zero annotations of result:

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

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

====

Analyzing function sum ...

  Trying degree: 1, 2

== sum :

  nat list -> nat

  Non-zero annotations of the argument:
      8.00  <--  [Cons([S(*)])]
     13.00  <--  [Cons([])]
      8.00  <--  []

  Non-zero annotations of result:

  Simplified bound:
     8.00 + 8.00*L*M + 13.00*M
   where
     M is the number of Cons-nodes of the argument
     L is the maximal number of S-nodes in the Cons-nodes of the argument

--
  Mode:          upper
  Metric:        steps
  Degree:        2
  Run time:      0.06 seconds
  #Constraints:  235

====