Resource Aware ML, Version 1.4.2, July 2018

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

Analyzing function max ...

  Trying degree: 1

== max :

  [int; int] -> int

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

  Non-zero annotations of result:

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

====

Analyzing function plus ...

  Trying degree: 1

== plus :

  [int; int] -> int

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

  Non-zero annotations of result:

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

====

Analyzing function minus ...

  Trying degree: 1

== minus :

  [int; int] -> int

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

  Non-zero annotations of result:

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

====

Analyzing function foldl ...

  Trying degree: 1

== foldl :

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

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

====

Analyzing function maxlist ...

  Trying degree: 1

== maxlist :

  int list -> int

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

  Non-zero annotations of result:

  Simplified bound:
     3.00 + 14.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:  159

====

Analyzing function scanr ...

  Trying degree: 1

== scanr :

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

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

  Non-zero annotations of result:

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

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

====

Analyzing function mms ...

  Trying degree: 1

== mms :

  int list -> int

  Non-zero annotations of the argument:
     10.00  <--  [Cons([])]
     32.00  <--  []

  Non-zero annotations of result:

  Simplified bound:
     32.00 + 10.00*M
   where
     M is the number of Cons-nodes of the argument

--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.08 seconds
  #Constraints:  682

====