Resource Aware ML, Version 1.4.2, July 2018

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

Analyzing function leq ...

  Trying degree: 1

== leq :

  [nat; nat] -> 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:  60

====

Analyzing function insert ...

  Trying degree: 1

== insert :

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

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

  Non-zero annotations of result:

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

====

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

====

Analyzing function isort ...

  Trying degree: 1

== isort :

  nat list -> nat list

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

  Non-zero annotations of result:

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

--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.03 seconds
  #Constraints:  217

====