Resource Aware ML, Version 1.4.2, July 2018

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

Analyzing function add ...

  Trying degree: 1

== add :

  [nat; nat] -> nat

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

  Non-zero annotations of result:

  Simplified bound:
     5.00 + 10.00*M
   where
     M is the number of Succ-nodes of the 1st component of the argument

--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.01 seconds
  #Constraints:  42

====

Analyzing function sub ...

  Trying degree: 1

== sub :

  [nat; nat] -> nat

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

  Non-zero annotations of result:

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

====

Analyzing function mult ...

  Trying degree: 1

== mult :

  [nat; 'a] -> nat

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

  Non-zero annotations of result:

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

--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.01 seconds
  #Constraints:  76

====

Analyzing function eval ...

  Trying degree: 1

== eval :

  expr -> nat

  Non-zero annotations of the argument:
     14.00  <--  [Add(*)]
     14.00  <--  [Sub(*)]
      3.00  <--  []

  Non-zero annotations of result:

  Simplified bound:
     3.00 + 14.00*L + 14.00*X
   where
     X is the number of Sub-nodes of the argument
     L is the number of Add-nodes of the argument

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

====

Analyzing function nat_to_int ...

  Trying degree: 1

== nat_to_int :

  nat -> int

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

  Non-zero annotations of result:

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

--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.01 seconds
  #Constraints:  36

====