Resource Aware ML, Version 1.4.2, July 2018

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

Analyzing function comp ...

  Trying degree: 1

== comp :

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

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

  Non-zero annotations of result:

  Simplified bound:
     5.00
--
  Mode:          upper
  Metric:        steps
  Degree:        1
  Run time:      0.00 seconds
  #Constraints:  12

====

Analyzing function rev1 ...

  Trying degree: 1, 2, 3

  A bound for rev1 could not be derived. The linear program is infeasible.

--
  Mode:          upper
  Metric:        steps
  Degree:        3
  Run time:      0.06 seconds
  #Constraints:  204

====

Analyzing function apply ...

  Trying degree: 1

== apply :

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

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

  Non-zero annotations of result:

  Simplified bound:
     3.00 + 3.00*K + 12.00*N
   where
     K is the number of Lam3-nodes of the 1st component of the argument
     N is the number of Lam1-nodes of the 1st component of the argument

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

====