Resource Aware ML, Version 1.4.2, July 2018

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

Analyzing function compare_list ...

  Trying degree: 1

== compare_list :

  [int list; int 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:  75

====

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

====

Analyzing function isort ...

  Trying degree: 1

== isort :

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

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

  Non-zero annotations of result:

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

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

====

Analyzing function isort_list ...

  Trying degree: 1

== isort_list :

  int list list -> int list list

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

  Non-zero annotations of result:

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

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

====