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:
      8.00  <--  ([S(*)], [])
      3.00  <--  ([], [])

  Non-zero annotations of result:

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

--
  Mode:          upper
  Metric:        steps
  Degree:        1
  Run time:      0.02 seconds
  #Constraints:  43

====

Analyzing function insert ...

  Trying degree: 1

== insert :

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

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

  Non-zero annotations of result:

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

--
  Mode:          upper
  Metric:        steps
  Degree:        1
  Run time:      0.02 seconds
  #Constraints:  66

====

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

====

Analyzing function isort ...

  Trying degree: 1, 2, 3

== isort :

  nat list -> nat list

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

  Non-zero annotations of result:

  Simplified bound:
     11.00 - 4.00*L*M + 4.00*L*M^2 + 8.00*M + 8.00*M^2
   where
     M is the number of Cons-nodes of the argument
     L is the maximal number of S-nodes in the Cons-nodes of the argument

--
  Mode:          upper
  Metric:        steps
  Degree:        3
  Run time:      0.66 seconds
  #Constraints:  3324

====