Cost recurrences for DML programs

DOI10.1145/507635.507666MaRDI QIDQ5178014zbMATH OpenOpenAlexFDO

Authors Bernd Grobauer

Publication date 9 March 2015

Published in Proceedings of the sixth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/507635.507666

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Denotational cost semantics for functional languages with inductive types
• Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
• More precise yet widely applicable cost analysis
• Topics in semantics-based program manipulation
• Closed-form upper bounds in static cost analysis

Cited in

(9)

• Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs
• A transformational approach to parametric accumulated-cost static profiling
• A general framework for static profiling of parametric resource usage
• A transformational approach to resource analysis with typed-norms inference
• Relational cost analysis in a functional-imperative setting
• Denotational semantics as a foundation for cost recurrence extraction for functional languages
• Implementation of Functional Languages
• Typable fragments of polynomial automatic amortized resource analysis
• Worst-case input generation for concurrent programs under non-monotone resource metrics

This page was built for publication: Cost recurrences for DML programs

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