Recurrence Extraction for Functional Programs through Call-by-Push-Value
The main way of analyzing the complexity of a program is that of extracting and solving a recurrence that expresses its running time in terms of the size of its input. We develop a method that automatically extracts such recurrences from the syntax of higher-order recursive functional programs. The resulting recurrences, which are programs in a call-by-name language with recursion, explicitly compute the running time in terms of the size of the input. In order to achieve this in a uniform way that covers both call-by-name and call-by-value evaluation strategies, we use Call-by-Push-Value (CBPV) as an intermediate language. Finally, we use domain theory to develop a denotational cost semantics for the resulting recurrences.
Wed 22 Jan
|11:45 - 12:07|
G. A. KavvosWesleyan University, Edward MorehouseWesleyan University, Dan LicataWesleyan University, Norman DannerWesleyan UniversityLink to publication DOI
|12:07 - 12:30|
Martin Adam Thomas HandleyUniversity of Nottingham, Niki VazouIMDEA Software Institute, Graham HuttonUniversity of Nottingham, UKLink to publication DOI