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

@article{Kavvos2020RecurrenceEF,
  title={Recurrence extraction for functional programs through call-by-push-value},
  author={G. A. Kavvos and Edward Morehouse and Daniel R. Licata and N. Danner},
  journal={Proceedings of the ACM on Programming Languages},
  year={2020},
  volume={4},
  pages={1 - 31}
}
  • G. A. Kavvos, Edward Morehouse, +1 author N. Danner
  • Published 2020
  • Computer Science
  • Proceedings of the ACM on Programming Languages
  • 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 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… CONTINUE READING

    Figures and Topics from this paper.

    Denotational recurrence extraction for amortized analysis
    • 1
    • PDF
    Denotational semantics as a foundation for cost recurrence extraction for functional languages
    • 1
    • PDF
    Raising expectations: automating expected cost analysis with types
    • 1
    • PDF
    Automatic and Efficient Variability-Aware Lifting of Functional Programs

    References

    Publications referenced by this paper.
    SHOWING 1-9 OF 9 REFERENCES
    Adequacy for Algebraic Effects
    • 124
    • Highly Influential
    • PDF
    Cost analysis of object-oriented bytecode programs
    • 101
    • Highly Influential
    • PDF
    Call-by-push-value: Decomposing call-by-value and call-by-name
    • 45
    • Highly Influential
    • PDF
    Fully Abstract Translations Between Functional Languages
    • 59
    • Highly Influential
    • PDF
    Cost Semantics for Plotkin's PCF
    • 2
    • Highly Influential
    Lectures on predomains and partial functions. Notes for a course given at CSLI, Stanford University
    • 1985
    Lectures on predomains and partial functions. Notes for a course given at CSLI, Stanford University
    • 1985
    Notes for a course given at CSLI
    • 1985
    Semantics and Logics of Computation: Operationally-Based Theories of Program Equivalence
    • A. Pitts
    • Computer Science, Mathematics
    • 1997
    • 145
    • Highly Influential
    • PDF