Typable fragments of polynomial automatic amortized resource analysis

DOI10.4230/LIPICS.CSL.2021.34MaRDI QIDQ6839800zbMATH OpenFDO

Authors Long H. Pham, Jan Hoffmann

Publication date 23 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.CSL.2021.34

zbMATH Keywords

amortized analysisquantitative analysisresource consumptiontypability

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A combination framework for complexity
• A new recursion-theoretic characterization of the polytime functions
• Amortised resource analysis and typed polynomial interpretations
• Amortized Computational Complexity
• Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
• Automated recurrence analysis for almost-linear expected-runtime bounds
• Cost recurrences for DML programs
• Exponential automatic amortized resource analysis
• scientific article; zbMATH DE number 512786 (Why is no real title available?)
• Lightweight semiformal time complexity analysis for purely functional data structures
• Mechanical program analysis
• Relational cost analysis
• Resource bound certification
• Static determination of quantitative resource usage for higher-order programs
• Static prediction of heap space usage for first-order functional programs
• The strength of non-size increasing computation
• Towards automatic resource bound analysis for OCaml
• Type-based cost analysis for lazy functional languages

This page was built for publication: Typable fragments of polynomial automatic amortized resource analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839800)