Resource Aware ML, Version 1.4.2, July 2018

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

Analyzing function firstline ...

  Trying degree: 1

== firstline :

  'a list -> int list

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

  Non-zero annotations of result:

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

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

====

Analyzing function newline ...

  Trying degree: 1

== newline :

  [int; int list; int list] -> int list

  Non-zero annotations of the argument:
     48.00  <--  (*, [::(*)], [])
      2.00  <--  (*, [], [::(*)])
      7.00  <--  (*, [], [])

  Non-zero annotations of result:

  Simplified bound:
     7.00 + 2.00*L + 48.00*M
   where
     L is the number of ::-nodes of the 3rd component of the argument
     M is the number of ::-nodes of the 2nd component of the argument

--
  Mode:          upper
  Metric:        steps
  Degree:        1
  Run time:      0.03 seconds
  #Constraints:  126

====

Analyzing function lcstable ...

  Trying degree: 1, 2

== lcstable :

  [int list; int list] -> int list list

  Non-zero annotations of the argument:
     50.00  <--  ([::(*)], [::(*)])
     27.00  <--  ([::(*)], [])
      8.00  <--  ([], [::(*)])
     11.00  <--  ([], [])

  Non-zero annotations of result:

  Simplified bound:
     11.00 + 8.00*L + 50.00*L*M + 27.00*M
   where
     L is the number of ::-nodes of the 2nd component of the argument
     M is the number of ::-nodes of the 1st component of the argument

--
  Mode:          upper
  Metric:        steps
  Degree:        2
  Run time:      0.16 seconds
  #Constraints:  905

====

Analyzing function lcs ...

  Trying degree: 1, 2

== lcs :

  [int list; int list] -> int

  Non-zero annotations of the argument:
     50.00  <--  ([::(*)], [::(*)])
     27.00  <--  ([::(*)], [])
      8.00  <--  ([], [::(*)])
     21.00  <--  ([], [])

  Non-zero annotations of result:

  Simplified bound:
     21.00 + 8.00*L + 50.00*L*M + 27.00*M
   where
     L is the number of ::-nodes of the 2nd component of the argument
     M is the number of ::-nodes of the 1st component of the argument

--
  Mode:          upper
  Metric:        steps
  Degree:        2
  Run time:      0.19 seconds
  #Constraints:  946

====