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: lower Metric: steps Degree: 1 Run time: 0.01 seconds #Constraints: 35 ==== Analyzing function newline ... Trying degree: 1 == newline : [int; int list; int list] -> int list Non-zero annotations of the argument: 7.00 <-- (*, [], []) Non-zero annotations of result: Simplified bound: 7.00 -- Mode: lower Metric: steps Degree: 1 Run time: 0.02 seconds #Constraints: 159 ==== Analyzing function lcstable ... Trying degree: 1 == lcstable : [int list; int list] -> int list list Non-zero annotations of the argument: 10.00 <-- ([::(*)], []) 8.00 <-- ([], [::(*)]) 11.00 <-- ([], []) Non-zero annotations of result: Simplified bound: 11.00 + 8.00*L + 10.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: lower Metric: steps Degree: 1 Run time: 0.04 seconds #Constraints: 274 ==== Analyzing function lcs ... Trying degree: 1 == lcs : [int list; int list] -> int Non-zero annotations of the argument: 10.00 <-- ([::(*)], []) 8.00 <-- ([], [::(*)]) 19.00 <-- ([], []) Non-zero annotations of result: Simplified bound: 19.00 + 8.00*L + 10.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: lower Metric: steps Degree: 1 Run time: 0.05 seconds #Constraints: 314 ====