Resource Aware ML, Version 1.4.2, July 2018

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

Analyzing function iplus ...

  Trying degree: 1

== iplus :

  [int; int] -> int

  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.00 seconds
  #Constraints:  13

====

Analyzing function imult ...

  Trying degree: 1

== imult :

  [int; int] -> int

  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.00 seconds
  #Constraints:  13

====

Analyzing function split ...

  Trying degree: 1

== split :

  int -> int * int

  Non-zero annotations of the argument:
     11.00  <--  *

  Non-zero annotations of result:

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

====

Analyzing function of_int ...

  Trying degree: 1

== of_int :

  'a -> 'a list

  Non-zero annotations of the argument:
      4.00  <--  *

  Non-zero annotations of result:

  Simplified bound:
     4.00
--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.00 seconds
  #Constraints:  10

====

Analyzing function is_int ...

  Trying degree: 1

== is_int :

  'a list -> bool

  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:  34

====

Analyzing function to_int_opt ...

  Trying degree: 1

== to_int_opt :

  int list -> int option

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

  Non-zero annotations of result:

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

====

Analyzing function add_int ...

  Trying degree: 1

== add_int :

  [int list; int] -> int 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.02 seconds
  #Constraints:  92

====

Analyzing function add ...

  Trying degree: 1

== add :

  [int list; int list] -> int list

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

  Non-zero annotations of result:

  Simplified bound:
     20.00
--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.07 seconds
  #Constraints:  304

====

Analyzing function mult_int ...

  Trying degree: 1

== mult_int :

  [int list; int] -> int list

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

  Non-zero annotations of result:

  Simplified bound:
     16.00 + 47.00*M
   where
     M is the number of ::-nodes of the 1st component of the argument

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

====

Analyzing function mult ...

  Trying degree: 1

== mult :

  [int list; int list] -> int list

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

  Non-zero annotations of result:

  Simplified bound:
     33.00 + 8.00*L + 68.00*M
   where
     L is the number of ::-nodes of the 2nd component of the argument
     M is the number of ::-nodes of the 1st component of the argument

--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.45 seconds
  #Constraints:  495

====