Resource Aware ML, Version 1.4.2, July 2018

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

Analyzing function append ...

  Trying degree: 1

== append :

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

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

  Non-zero annotations of result:

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

--
  Mode:          upper
  Metric:        steps
  Degree:        1
  Run time:      0.01 seconds
  #Constraints:  33

====

Analyzing function rev ...

  Trying degree: 1, 2

== rev :

  'a list -> 'a list

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

  Non-zero annotations of result:

  Simplified bound:
     3.00 + 9.50*M + 4.50*M^2
   where
     M is the number of Cons-nodes of the argument

--
  Mode:          upper
  Metric:        steps
  Degree:        2
  Run time:      0.06 seconds
  #Constraints:  200

====