Resource Aware ML, Version 1.4.2, July 2018

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

Analyzing function map ...

  Trying degree: 1

== map :

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

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

  Non-zero annotations of result:

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

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

====

Analyzing function length ...

  Trying degree: 1

== length :

  'a list -> nat

  Non-zero annotations of the argument:
      7.00  <--  [Cons(*)]
      3.00  <--  []

  Non-zero annotations of result:

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

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

====

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 const ...

  Trying degree: 1

== const :

  ['a; 'b] -> 'a

  Non-zero annotations of the argument:
      1.00  <--  (*, *)

  Non-zero annotations of result:

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

====

Analyzing function halve ...

  Trying degree: 1

== halve :

  nat -> nat

  Non-zero annotations of the argument:
      4.00  <--  [S(*)]
      3.00  <--  []

  Non-zero annotations of result:

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

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

====

Analyzing function tail ...

  Trying degree: 1

== tail :

  'a list -> 'a list

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

  Non-zero annotations of result:

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

====

Analyzing function head ...

  Trying degree: 1

== head :

  'a list -> 'a

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

  Non-zero annotations of result:

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

====

Analyzing function take ...

  Trying degree: 1

== take :

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

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

  Non-zero annotations of result:

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

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

====

Analyzing function drop ...

  Trying degree: 1

== drop :

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

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

  Non-zero annotations of result:

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

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

====

Analyzing function divideAndConquer ...

  Trying degree: 1

== divideAndConquer :

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

  Non-zero annotations of the argument:
     14.00  <--  (*, *, *, *, *)

  Non-zero annotations of result:

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

====

Analyzing function merge ...

  Trying degree: 1

== merge :

  [nat list; nat list] -> nat list

  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.04 seconds
  #Constraints:  188

====

Analyzing function mergesort ...

  Trying degree: 1

== mergesort :

  nat list -> nat list

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

  Non-zero annotations of result:

  Simplified bound:
     34.00
--
  Mode:          lower
  Metric:        steps
  Degree:        1
  Run time:      0.10 seconds
  #Constraints:  639

====