Recurrence extraction for functional programs through call-by-push-value

GA Kavvos, E Morehouse, DR Licata… - Proceedings of the ACM …, 2019 - dl.acm.org
The main way of analysing 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 …

Recurrence Extraction for Functional Programs through Call-by-Push-Value (Extended Version)

GA Kavvos, E Morehouse, DR Licata… - arXiv e …, 2019 - ui.adsabs.harvard.edu
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 …

[PDF][PDF] Recurrence Extraction for Functional Programs Through Call-by-Push-Value

A Kavvos - arXiv preprint arXiv:1911.04588, 2019 - seis.bristol.ac.uk
Recurrence Extraction for Functional Programs Through Call-by-Push-Value Page 1 Alex
Kavvos Department of Computer Science, Aarhus University Recurrence Extraction for …

Recurrence Extraction for Functional Programs through Call-by-Push-Value (Extended Version)

GA Kavvos, E Morehouse, DR Licata… - arXiv preprint arXiv …, 2019 - arxiv.org
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 …

Recurrence extraction for functional programs through call-by-push-value

GA Kavvos, E Morehouse… - … of the ACM on …, 2019 - research-information.bris.ac.uk
The main way of analysing 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 …

Recurrence Extraction for Functional Programs Through Call-by-Push-Value

A Kavvos - arXiv preprint arXiv:1911.04588, 2019 - seis.bristol.ac.uk
Alex Kavvos Page 1 Alex Kavvos Department of Computer Science, Aarhus University
Recurrence Extraction for Functional Programs Through Call-by-Push-Value arXiv:1911.04588 …