Resource Aware ML, Version 1.4.2, July 2018

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

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:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.01 seconds
  #Constraints:  40

====

Analyzing function mult ...

  Trying degree: 1

== mult :

  [nat; nat] -> nat

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

  Non-zero annotations of result:

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

--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.02 seconds
  #Constraints:  80

====

Analyzing function square ...

  Trying degree: 1

== square :

  nat -> nat

  Non-zero annotations of the argument:
     12.00  <--  [S(*)]
      7.00  <--  []

  Non-zero annotations of result:

  Simplified bound:
     7.00 + 12.00*M
   where
     M is the number of S-nodes of the argument

--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.02 seconds
  #Constraints:  89

====

Analyzing function unfoldr ...

  Trying degree: 1

== unfoldr :

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

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

  Non-zero annotations of result:

  Simplified bound:
     7.00
--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.01 seconds
  #Constraints:  44

====

Analyzing function countdown ...

  Trying degree: 1

== countdown :

  nat -> nat option

  Non-zero annotations of the argument:
      3.00  <--  []

  Non-zero annotations of result:

  Simplified bound:
     3.00
--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.01 seconds
  #Constraints:  26

====

Analyzing function enum ...

  Trying degree: 1

== enum :

  nat -> nat list

  Non-zero annotations of the argument:
      3.00  <--  []

  Non-zero annotations of result:

  Simplified bound:
     3.00
--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.02 seconds
  #Constraints:  97

====

Analyzing function map ...

  Trying degree: 1

== map :

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

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

  Non-zero annotations of result:

  Simplified bound:
     3.00 + 11.00*M
   where
     M is the number of Cons-nodes of the 2nd component of the argument

--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.02 seconds
  #Constraints:  41

====

Analyzing function sum ...

  Trying degree: 1

== sum :

  nat list -> nat

  Non-zero annotations of the argument:
     11.00  <--  [Cons([])]
      3.00  <--  []

  Non-zero annotations of result:

  Simplified bound:
     3.00 + 11.00*M
   where
     M is the number of Cons-nodes of the argument

--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.02 seconds
  #Constraints:  71

====

Analyzing function sum_sqs ...

  Trying degree: 1

== sum_sqs :

  nat -> nat

  Non-zero annotations of the argument:
     17.00  <--  []

  Non-zero annotations of result:

  Simplified bound:
     17.00
--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.04 seconds
  #Constraints:  295

====